Approximating minimum-cost connectivity problems

Guy Kortsarz, Zeev Nutov

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review


We survey approximation algorithms and hardness results for versions of the Generalized Steiner Network (GSN) probleminwhichwe seek tofind a low-cost subgraph (where the cost of a subgraph is the sum of the costs of its edges) that satisfies prescribed connectivity requirements. These problems include the following well-known problems: min-cost k-flow, min-cost spanning tree, traveling salesman, directed/undirected Steiner tree, Steiner forest, k-edge/node-connected spanning subgraph, and others.

Original languageEnglish
Title of host publicationHandbook of Approximation Algorithms and Metaheuristics
PublisherCRC Press
ISBN (Electronic)9781420010749
ISBN (Print)1584885505, 9781584885504
StatePublished - 1 Jan 2007

Bibliographical note

Publisher Copyright:
© 2007 by Taylor & Francis Group, LLC.


Dive into the research topics of 'Approximating minimum-cost connectivity problems'. Together they form a unique fingerprint.

Cite this