@inproceedings{f94085e383d747aa88db402dc99beb3c,
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",
month = jun,
day = "30",
doi = "10.1007/978-3-030-79987-8_1",
language = "الإنجليزيّة",
isbn = "9783030799861",
volume = "12757",
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 = "ألمانيا",
}