Approximation algorithms for node-weighted buy-at-bulk network design

We present algorithms with poly-logarithmic approximation ratios for the buy-at-bulk network design problem in the node-weighted setting. We obtain the following results where <i>h</i> is the number of pairs in the input. • On <i>O</i>(log <i>h</i>) approximation for the single-sink non-uniform buy-at-bulk network design. Unless <i>P</i> = <i>NP</i> this ratio is tight up to constant factors. • An <i>O</i>(log<sup>4</sup> <i>h</i>) approximation for the multi-commodity non-uniform buy-at-bulk network design problem.

[1]  Sudipto Guha,et al.  A constant factor approximation for the single sink edge installation problems , 2001, STOC '01.

[2]  Satish Rao,et al.  A tight bound on approximating arbitrary metrics by tree metrics , 2003, STOC '03.

[3]  Mohammad Taghi Hajiaghayi,et al.  Approximation Algorithms for Non-Uniform Buy-at-Bulk Network Design , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[4]  David S. Johnson,et al.  Approximation algorithms for combinatorial problems , 1973, STOC.

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

[6]  William J. Cook,et al.  Combinatorial optimization , 1997 .

[7]  Tim Roughgarden,et al.  Approximation via cost-sharing: a simple approximation algorithm for the multicommodity rent-or-buy problem , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[8]  Yuval Rabani,et al.  Approximation algorithms for constrained for constrained node weighted steiner tree problems , 2001, STOC '01.

[9]  Vijay V. Vazirani,et al.  Approximation Algorithms , 2001, Springer Berlin Heidelberg.

[10]  Joseph Naor,et al.  A deterministic algorithm for the cost-distance problem , 2001, SODA '01.

[11]  Mohammad Taghi Hajiaghayi,et al.  Oblivious routing on node-capacitated and directed graphs , 2005, SODA '05.

[12]  A. Schrijver.  A Course in Combinatorial Optimization , 1990 .

[13]  Kamal Jain,et al.  A Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[14]  R. Ravi,et al.  Approximating the Single-Sink Link-Installation Problem in Network Design , 2001, SIAM J. Optim..

[15]  Yair Bartal,et al.  Probabilistic approximation of metric spaces and its algorithmic applications , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[16]  Lisa Zhang,et al.  Approximation Algorithms for Access Network Design , 2002, Algorithmica.

[17]  Tim Roughgarden,et al.  Simpler and better approximation algorithms for network design , 2003, STOC '03.

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

[19]  David P. Williamson,et al.  An iterative rounding 2-approximation algorithm for the element connectivity problem , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[20]  Kunal Talwar,et al.  The Single-Sink Buy-at-Bulk LP Has Constant Integrality Gap , 2002, IPCO.

[21]  Joseph Naor,et al.  On the approximability of some network design problems , 2005, SODA '05.

[22]  Mohammad Taghi Hajiaghayi,et al.  Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees , 2006, APPROX-RANDOM.

[23]  Matthew Andrews,et al.  Hardness of buy-at-bulk network design , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[24]  Moses Charikar,et al.  On non-uniform multicommodity buy-at-bulk network design , 2005, STOC '05.

[25]  Dorit S. Hochbaum,et al.  Approximation Algorithms for NP-Hard Problems , 1996 .

[26]  Sanjeev Khanna,et al.  Multicommodity flow, well-linked terminals, and routing problems , 2005, STOC '05.

[27]  James R. Lee,et al.  Improved approximation algorithms for minimum-weight vertex separators , 2005, STOC '05.

[28]  Kamesh Munagala,et al.  Cost-distance: two metric network design , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

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

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

[31]  Yossi Azar,et al.  Buy-at-bulk network design , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.