Relaxed and Approximate Graph Realizations

Amotz Bar-Noy, David Peleg, Mor Perry, Dror Rawitz

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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 languageEnglish
Title of host publicationCombinatorial Algorithms - 32nd International Workshop, IWOCA 2021, Proceedings
EditorsPaola Flocchini, Lucia Moura
PublisherSpringer Science and Business Media Deutschland GmbH
Pages3-19
Number of pages17
ISBN (Electronic)3030799875
ISBN (Print)9783030799861
DOIs
StatePublished - 30 Jun 2021
Event32nd International Workshop on Combinatorial Algorithms, IWOCA 2021 - Virtual, Online
Duration: 5 Jul 20217 Jul 2021

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume12757 LNCS

Conference

Conference32nd International Workshop on Combinatorial Algorithms, IWOCA 2021
CityVirtual, Online
Period5/07/217/07/21

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Relaxed and Approximate Graph Realizations'. Together they form a unique fingerprint.

Cite this