论文信息 - A 3/2-Approximation Algorithm for Generalized Steiner Trees in Complete Graphs with Edge Lengths 1 and 2

A 3/2-Approximation Algorithm for Generalized Steiner Trees in Complete Graphs with Edge Lengths 1 and 2

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.

Marek Karpinski | Piotr Berman | Alex Zelikovsky

[1] R. Ravi,et al. When trees collide: an approximation algorithm for the generalized Steiner problem on networks , 1991, STOC '91.

[2] Marshall W. Bern,et al. The Steiner Problem with Edge Lengths 1 and 2 , 1989, Inf. Process. Lett..

[3] Andrzej Lingas,et al. Polynomial-Time Approximation Schemes for the Euclidean Survivable Network Design Problem , 2002, ICALP.

[4] Marek Karpinski,et al. 1.25-Approximation Algorithm for Steiner Tree Problem with Distances 1 and 2 , 2009, WADS.

[5] Alex Zelikovsky,et al. Tighter Bounds for Graph Steiner Tree Approximation , 2005, SIAM J. Discret. Math..

[6] Robin Milner,et al. On Observing Nondeterminism and Concurrency , 1980, ICALP.

[7] V. J. Rayward-Smith,et al. The computation of nearly minimal Steiner trees in graphs , 1983 .

[8] Fabrizio Grandoni,et al. An improved LP-based approximation for steiner tree , 2010, STOC '10.