TY - GEN

T1 - A 3/2-approximation algorithm for generalized steiner trees in complete graphs with edge lengths 1 and 2

AU - Berman, Piotr

AU - Karpinski, Marek

AU - Zelikovsky, Alexander

N1 - Funding Information:
★ Research partially done while visiting Department of Computer Science, University of Bonn and supported by DFG grant Bo 56/174-1. ★★Supported in part by DFG grants, Procope grant 31022, and the Hausdorff Center grant EXC59-1. ★★★ Supported in part by NSF grant IIS-0916948.

PY - 2010

Y1 - 2010

N2 - Given a graph with edge lengths and a set of pairs of vertices which should be connected (requirements) the Generalized Steiner Tree Problem (GSTP) asks for a minimum length subgraph that connects every requirement. For the Generalized Steiner Tree Problem restricted to complete graphs with edge lengths 1 and 2, we provide a 1.5-approximation algorithm. It is the first algorithm with the approximation ratio significantly better than 2 for a class of graphs for which GSTP is MAX SNP-hard.

AB - Given a graph with edge lengths and a set of pairs of vertices which should be connected (requirements) the Generalized Steiner Tree Problem (GSTP) asks for a minimum length subgraph that connects every requirement. For the Generalized Steiner Tree Problem restricted to complete graphs with edge lengths 1 and 2, we provide a 1.5-approximation algorithm. It is the first algorithm with the approximation ratio significantly better than 2 for a class of graphs for which GSTP is MAX SNP-hard.

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

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

U2 - 10.1007/978-3-642-17517-6_4

DO - 10.1007/978-3-642-17517-6_4

M3 - Conference contribution

AN - SCOPUS:78650852906

SN - 3642175163

SN - 9783642175169

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 15

EP - 24

BT - Algorithms and Computation - 21st International Symposium, ISAAC 2010, Proceedings

T2 - 21st Annual International Symposium on Algorithms and Computations, ISAAC 2010

Y2 - 15 December 2010 through 17 December 2010

ER -