Multi-rooted Greedy Approximation of Directed Steiner Trees with Applications

We present a greedy algorithm for the directed Steiner tree problem (DST), where any tree rooted at any (uncovered) terminal can be a candidate for greedy choice. It will be shown that the algorithm, running in polynomial time for any constant l, outputs a directed Steiner tree of cost no larger than 2(l−1)(ln n+1) times the cost of the minimum l-restricted Steiner tree. We derive from this result that 1) DST for a class of graphs, including quasi-bipartite graphs, in which the length of paths induced by Steiner vertices is bounded by some constant can be approximated within a factor of O(logn), and 2) the tree cover problem on directed graphs can also be approximated within a factor of O(logn).

[1]  Fabrizio Grandoni,et al.  Steiner Tree Approximation via Iterative Randomized Rounding , 2013, JACM.

[2]  Toshihiro Fujito.  How to Trim an MST: A 2-Approximation Algorithm for Minimum Cost Tree Cover , 2006, ICALP.

[3]  Gruia Calinescu,et al.  The Polymatroid Steiner Problems , 2005, J. Comb. Optim..

[4]  Sudipto Guha,et al.  Approximation algorithms for directed Steiner problems , 1999, SODA '98.

[5]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[6]  Toshihiro Fujito.  How to trim a MST: A 2-Approximation algorithm for minimum cost-tree cover , 2012, TALG.

[7]  Ran Raz,et al.  A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP , 1997, STOC '97.

[8]  Viet Hung Nguyen.  Approximation Algorithm for the Minimum Directed Tree Cover , 2010, COCOA.

[9]  Alex Zelikovsky,et al.  A series of approximation algorithms for the acyclic directed steiner tree problem , 1997, Algorithmica.

[10]  Miroslav Chlebík,et al.  The Steiner tree problem on graphs: Inapproximability results , 2008, Theor. Comput. Sci..

[11]  Carla D. Savage,et al.  Depth-First Search and the Vertex Cover Problem , 1982, Inf. Process. Lett..

[12]  Marek Karpinski,et al.  New Approximation Algorithms for the Steiner Tree Problems , 1997, J. Comb. Optim..

[13]  Vijay V. Vazirani,et al.  On the bidirected cut relaxation for the metric Steiner tree problem , 1999, SODA '99.

[14]  Piotr Berman,et al.  Improved approximations for the Steiner tree problem , 1992, SODA '92.

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

[16]  Ojas Parekh,et al.  Improved Approximations for Tour and Tree Covers , 2000, Algorithmica.

[17]  Thomas Rothvoß.  Directed Steiner Tree and the Lasserre Hierarchy , 2011, ArXiv.

[18]  Robert Krauthgamer,et al.  Polylogarithmic inapproximability , 2003, STOC '03.

[19]  Alex Zelikovsky,et al.  An 11/6-approximation algorithm for the network steiner problem , 1993, Algorithmica.

[20]  Samir Khuller,et al.  On directed Steiner trees , 2002, SODA '02.

[21]  Guy Kortsarz,et al.  Approximating the Weight of Shallow Steiner Trees , 1999, Discret. Appl. Math..

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