Sciweavers

Share
STOC
2010
ACM

An Improved LP-based Approximation for Steiner Tree

9 years 3 months ago
An Improved LP-based Approximation for Steiner Tree
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning the terminals. In a sequence of papers, the approximation ratio for this problem was improved from ¾ to the current best ½ [Robins,Zelikovsky-SIDMA’05]. All these algorithms are purely combinatorial. A long-standing open problem is whether there is an LP-relaxation for Steiner tree with integrality gap smaller than ¾ [Vazirani,Rajagopalan-SODA’99]. In this paper we improve the approximation factor for Steiner tree, developing an LP-based approximation algorithm. Our algorithm is based on a, seemingly novel, iterative randomized rounding technique. We consider a directed-component cut relaxation for the -restricted Steiner tree problem. We sample one of these components with probability proportional to the value of the associated variable in the optimal fractional solution and contract it. We iterate th...
Jaroslaw Byrka, Fabrizio Grandoni, Thomas Rothvoss
Added 17 Jul 2010
Updated 17 Jul 2010
Type Conference
Year 2010
Where STOC
Authors Jaroslaw Byrka, Fabrizio Grandoni, Thomas Rothvoss and Laura Sanita
Comments (0)
books