Online Node-Weighted Steiner Forest and Extensions via Disk Paintings

We give the first polynomial-time online algorithm for the node-weighted Steiner forest problem with a poly-logarithmic competitive ratio. The competitive ratio of our algorithm is optimal up to a logarithmic factor. For the special case of graphs with an excluded fixed minor (e.g., planar graphs), we obtain a logarithmic competitive ratio, which is optimal up to a constant, using a different online algorithm. Both these results are obtained as special cases of generic results for a large class of problems that can be encoded as online 0, 1-proper functions. Our results are obtained by using a new framework for online network design problems that we call disk paintings. The central idea in this technique is to amortize the cost of primal updates to a set of carefully selected mutually disjoint fixed-radius dual disks centered at a subset of terminals. We hope that this framework will be useful for other online network design problems.

[1]  Jack Edmonds,et al.  Matching: A Well-Solved Class of Integer Linear Programs , 2001, Combinatorial Optimization.

[2]  Makoto Imase,et al.  Dynamic Steiner Tree Problem , 1991, SIAM J. Discret. Math..

[3]  Piotr Berman,et al.  On-line algorithms for Steiner tree problems (extended abstract) , 1997, STOC '97.

[4]  R. Ravi,et al.  When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks , 1995, SIAM J. Comput..

[5]  Noga Alon,et al.  A general approach to online network optimization problems , 2004, SODA '04.

[6]  Samir Khuller,et al.  Improved Methods for Approximating Node Weighted Steiner Trees and Connected Dominating Sets , 1998, FSTTCS.

[7]  Joseph Naor,et al.  The Design of Competitive Online Algorithms via a Primal-Dual Approach , 2009, Found. Trends Theor. Comput. Sci..

[8]  Carsten Moldenhauer,et al.  Primal-dual approximation algorithms for Node-Weighted Steiner Forest on planar graphs , 2011, Inf. Comput..

[9]  David P. Williamson,et al.  An O(logn)-Competitive Algorithm for Online Constrained Forest Problems , 2011, ICALP.

[10]  R. Ravi,et al.  A nearly best-possible approximation algorithm for node-weighted Steiner trees , 1993, IPCO.

[11]  Yuval Rabani,et al.  Approximation Algorithms for Constrained Node Weighted Steiner Tree Problems , 2007, SIAM J. Comput..

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

[13]  Philip N. Klein,et al.  Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs , 2009, ICALP.

[14]  Noga Alon,et al.  THE ONLINE SET COVER PROBLEM∗ , 2009 .

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

[16]  Philip N. Klein,et al.  Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs , 2009, TALG.

[17]  W. Mader.  Homomorphieeigenschaften und mittlere Kantendichte von Graphen , 1967 .

[18]  Chandra Chekuri,et al.  Node-weighted Network Design in Planar and Minor-closed Families of Graphs , 2012, ICALP.

[19]  David P. Williamson,et al.  A general approximation technique for constrained forest problems , 1992, SODA '92.

[20]  Chung-Lun Li,et al.  The point-to-point delivery and connection problems: complexity and algorithms , 1992, Discret. Appl. Math..

[21]  Alexandr V. Kostochka,et al.  Lower bound of the hadwiger number of graphs by their average degree , 1984, Comb..

[22]  Zeev Nutov.  Approximating Steiner Networks with Node-Weights , 2010, SIAM J. Comput..

[23]  Sudipto Guha,et al.  Efficient recovery from power outage (extended abstract) , 1999, STOC '99.

[24]  Yossi Azar,et al.  On-line generalized Steiner problem , 1996, SODA '96.

[25]  Mohit Singh,et al.  Online Node-Weighted Steiner Tree and Related Problems , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

[26]  Dorit S. Hochbaum,et al.  Heuristics for the fixed cost median problem , 1982, Math. Program..