TY - CHAP

T1 - Approximating minimum-cost connectivity problems

AU - Kortsarz, Guy

AU - Nutov, Zeev

N1 - Publisher Copyright:
© 2007 by Taylor & Francis Group, LLC.
Copyright:
Copyright 2018 Elsevier B.V., All rights reserved.

PY - 2007/1/1

Y1 - 2007/1/1

N2 - 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.

AB - 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.

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

U2 - 10.1201/9781420010749

DO - 10.1201/9781420010749

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.chapter???

AN - SCOPUS:48549091072

SN - 1584885505

SN - 9781584885504

SP - 58-1-58-22

BT - Handbook of Approximation Algorithms and Metaheuristics

PB - CRC Press

ER -