Relaxed and Approximate Graph Realizations

Amotz Bar-Noy; Toni Böhnlein; David Peleg; Mor Perry; Dror Rawitz

doi:10.1007/978-3-030-79987-8_1

Relaxed and Approximate Graph Realizations

Amotz Bar-Noy, Toni Böhnlein, David Peleg, Mor Perry, Dror Rawitz

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

2 Scopus citations

Abstract

A network realization problem involves a given specification for some network parameters (such as vertex degrees or inter-vertex distances), and requires constructing a network G that satisfies, if possible. In many settings, it may be difficult or impossible to come up with a precise realization (e.g., the specification data might be inaccurate, or the reconstruction problem might be computationally infeasible). In this expository paper, we review various alternative approaches for coping with these difficulties by relaxing the requirements, discuss the resulting problems and illustrate some (precise or approximate) solutions.

Original language	English
Title of host publication	Combinatorial Algorithms - 32nd International Workshop, IWOCA 2021, Proceedings
Editors	Paola Flocchini, Lucia Moura
Publisher	Springer Science and Business Media Deutschland GmbH
Pages	3-19
Number of pages	17
ISBN (Print)	9783030799861
DOIs	https://doi.org/10.1007/978-3-030-79987-8_1
State	Published - 2021
Event	32nd International Workshop on Combinatorial Algorithms, IWOCA 2021 - Virtual, Online Duration: 5 Jul 2021 → 7 Jul 2021

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	12757 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	32nd International Workshop on Combinatorial Algorithms, IWOCA 2021
City	Virtual, Online
Period	5/07/21 → 7/07/21

Bibliographical note

Publisher Copyright:
© 2021, Springer Nature Switzerland AG.

Funding

Supported in part by a US-Israel BSF grant (2018043).

Funders	Funder number
US-Israel BSF	2018043

Access to Document

10.1007/978-3-030-79987-8_1

Cite this

Bar-Noy, A., Böhnlein, T., Peleg, D., Perry, M., & Rawitz, D. (2021). Relaxed and Approximate Graph Realizations. In P. Flocchini, & L. Moura (Eds.), Combinatorial Algorithms - 32nd International Workshop, IWOCA 2021, Proceedings (pp. 3-19). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 12757 LNCS). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-030-79987-8_1

Bar-Noy, Amotz ; Böhnlein, Toni ; Peleg, David et al. / Relaxed and Approximate Graph Realizations. Combinatorial Algorithms - 32nd International Workshop, IWOCA 2021, Proceedings. editor / Paola Flocchini ; Lucia Moura. Springer Science and Business Media Deutschland GmbH, 2021. pp. 3-19 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{1fc649bfe85d4f86923c7d8f5e7184fc,

title = "Relaxed and Approximate Graph Realizations",

abstract = "A network realization problem involves a given specification for some network parameters (such as vertex degrees or inter-vertex distances), and requires constructing a network G that satisfies, if possible. In many settings, it may be difficult or impossible to come up with a precise realization (e.g., the specification data might be inaccurate, or the reconstruction problem might be computationally infeasible). In this expository paper, we review various alternative approaches for coping with these difficulties by relaxing the requirements, discuss the resulting problems and illustrate some (precise or approximate) solutions.",

author = "Amotz Bar-Noy and Toni B{\"o}hnlein and David Peleg and Mor Perry and Dror Rawitz",

note = "Publisher Copyright: {\textcopyright} 2021, Springer Nature Switzerland AG.; 32nd International Workshop on Combinatorial Algorithms, IWOCA 2021 ; Conference date: 05-07-2021 Through 07-07-2021",

year = "2021",

doi = "10.1007/978-3-030-79987-8_1",

language = "אנגלית",

isbn = "9783030799861",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Science and Business Media Deutschland GmbH",

pages = "3--19",

editor = "Paola Flocchini and Lucia Moura",

booktitle = "Combinatorial Algorithms - 32nd International Workshop, IWOCA 2021, Proceedings",

address = "גרמניה",

}

Bar-Noy, A, Böhnlein, T, Peleg, D, Perry, M & Rawitz, D 2021, Relaxed and Approximate Graph Realizations. in P Flocchini & L Moura (eds), Combinatorial Algorithms - 32nd International Workshop, IWOCA 2021, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 12757 LNCS, Springer Science and Business Media Deutschland GmbH, pp. 3-19, 32nd International Workshop on Combinatorial Algorithms, IWOCA 2021, Virtual, Online, 5/07/21. https://doi.org/10.1007/978-3-030-79987-8_1

Relaxed and Approximate Graph Realizations. / Bar-Noy, Amotz; Böhnlein, Toni; Peleg, David et al.
Combinatorial Algorithms - 32nd International Workshop, IWOCA 2021, Proceedings. ed. / Paola Flocchini; Lucia Moura. Springer Science and Business Media Deutschland GmbH, 2021. p. 3-19 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 12757 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Relaxed and Approximate Graph Realizations

AU - Bar-Noy, Amotz

AU - Böhnlein, Toni

AU - Peleg, David

AU - Perry, Mor

AU - Rawitz, Dror

PY - 2021

Y1 - 2021

N2 - A network realization problem involves a given specification for some network parameters (such as vertex degrees or inter-vertex distances), and requires constructing a network G that satisfies, if possible. In many settings, it may be difficult or impossible to come up with a precise realization (e.g., the specification data might be inaccurate, or the reconstruction problem might be computationally infeasible). In this expository paper, we review various alternative approaches for coping with these difficulties by relaxing the requirements, discuss the resulting problems and illustrate some (precise or approximate) solutions.

AB - A network realization problem involves a given specification for some network parameters (such as vertex degrees or inter-vertex distances), and requires constructing a network G that satisfies, if possible. In many settings, it may be difficult or impossible to come up with a precise realization (e.g., the specification data might be inaccurate, or the reconstruction problem might be computationally infeasible). In this expository paper, we review various alternative approaches for coping with these difficulties by relaxing the requirements, discuss the resulting problems and illustrate some (precise or approximate) solutions.

UR - http://www.scopus.com/inward/record.url?scp=85111985213&partnerID=8YFLogxK

U2 - 10.1007/978-3-030-79987-8_1

DO - 10.1007/978-3-030-79987-8_1

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85111985213

SN - 9783030799861

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 3

EP - 19

BT - Combinatorial Algorithms - 32nd International Workshop, IWOCA 2021, Proceedings

A2 - Flocchini, Paola

A2 - Moura, Lucia

PB - Springer Science and Business Media Deutschland GmbH

T2 - 32nd International Workshop on Combinatorial Algorithms, IWOCA 2021

Y2 - 5 July 2021 through 7 July 2021

ER -

Bar-Noy A, Böhnlein T, Peleg D, Perry M, Rawitz D. Relaxed and Approximate Graph Realizations. In Flocchini P, Moura L, editors, Combinatorial Algorithms - 32nd International Workshop, IWOCA 2021, Proceedings. Springer Science and Business Media Deutschland GmbH. 2021. p. 3-19. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-030-79987-8_1

Relaxed and Approximate Graph Realizations

Abstract

Publication series

Conference

Bibliographical note

Funding

Access to Document

Other files and links

Fingerprint

Cite this