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.
|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|
|Number of pages||17|
|State||Published - 2021|
|Event||32nd International Workshop on Combinatorial Algorithms, IWOCA 2021 - Virtual, Online|
Duration: 5 Jul 2021 → 7 Jul 2021
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Conference||32nd International Workshop on Combinatorial Algorithms, IWOCA 2021|
|Period||5/07/21 → 7/07/21|
Bibliographical noteFunding Information:
Supported in part by a US-Israel BSF grant (2018043).
© 2021, Springer Nature Switzerland AG.