Simpler and better approximation algorithms for network design

We give simple and easy-to-analyze randomized approximation algorithms for several well-studied NP-hard network design problems. Our algorithms improve over the previously best known approximation ratios. Our main results are the following.We give a randomized 3.55-approximation algorithm for the connected facility location problem. The algorithm requires three lines to state, one page to analyze, and improves the best-known performance guarantee for the problem.We give a 5.55-approximation algorithm for virtual private network design. Previously, constant-factor approximation algorithms were known only for special cases of this problem.We give a simple constant-factor approximation algorithm for the single-sink buy-at-bulk network design problem. Our performance guarantee improves over what was previously known, and is an order of magnitude improvement over previous combinatorial approximation algorithms for the problem.

[1]  Amit Kumar,et al.  Provisioning a virtual private network: a network design problem for multicommodity flow , 2001, STOC '01.

[2]  Alex Zelikovsky,et al.  Improved Steiner tree approximation in graphs , 2000, SODA '00.

[3]  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..

[4]  R. Ravi,et al.  Approximation Algorithms for the Traveling Purchaser Problem and its Variants in Network Design , 1999, ESA.

[5]  Aravind Srinivasan,et al.  Cost-Sharing Mechanisms for Network Design , 2004, APPROX-RANDOM.

[6]  Steve Y. Chiu,et al.  A Branch and Cut Algorithm for a Steiner Tree-Star Problem , 1996, INFORMS J. Comput..

[7]  R. Ravi,et al.  Approximation Algorithms for a Capacitated Network Design Problem , 2003, Algorithmica.

[8]  Vijay V. Vazirani,et al.  Equitable cost allocations via primal-dual-type algorithms , 2002, STOC '02.

[9]  Timothy J. Lowe,et al.  On the location of a tree-shaped facility , 1996, Networks.

[10]  Vijay V. Vazirani,et al.  Applications of approximation algorithms to cooperative games , 2001, STOC '01.

[11]  Anupam Gupta,et al.  Stochastic Steiner Trees Without a Root , 2005, ICALP.

[12]  Subhash Suri,et al.  Designing Least-Cost Nonblocking Broadband Networks , 1997, J. Algorithms.

[13]  Albert G. Greenberg,et al.  A flexible model for resource management in virtual private networks , 1999, SIGCOMM '99.

[14]  Kamesh Munagala,et al.  Designing networks incrementally , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

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

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

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

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

[19]  Moshe Lewenstein,et al.  A faster implementation of the Goemans-Williamson clustering algorithm , 2001, SODA '01.

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

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

[22]  Yuval Rabani,et al.  Competitive Algorithms for Distributed Data Management , 1995, J. Comput. Syst. Sci..

[23]  Deborah Estrin,et al.  Simultaneous Optimization for Concave Costs: Single Sink Aggregation or Single Source Buy-at-Bulk , 2003, SODA '03.

[24]  Nicole Immorlica,et al.  On the costs and benefits of procrastination: approximation algorithms for stochastic combinatorial optimization problems , 2004, SODA '04.

[25]  Juan José Salazar González,et al.  The Median Cycle Problem , 2001 .

[26]  David P. Williamson,et al.  Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees, with Applications to Matching and Set Cover , 1993, ICALP.

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

[28]  Luca Becchetti,et al.  Sharing the cost more efficiently: improved approximation for multicommodity rent-or-buy , 2005, SODA '05.

[29]  Jochen Könemann,et al.  A group-strategyproof mechanism for Steiner forests , 2005, SODA '05.

[30]  R. Ravi,et al.  What About Wednesday? Approximation Algorithms for Multistage Stochastic Optimization , 2005, APPROX-RANDOM.

[31]  Chaitanya Swamy,et al.  Primal–Dual Algorithms for Connected Facility Location Problems , 2004, Algorithmica.

[32]  Friedrich Eisenbrand,et al.  An improved approximation algorithm for virtual private network design , 2005, SODA '05.

[33]  R. Prim.  Shortest connection networks and some generalizations , 1957 .

[34]  Sudipto Guha,et al.  Hierarchical placement and network design problems , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[35]  David R. Karger,et al.  Building Steiner trees with incomplete global knowledge , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[36]  Tim Roughgarden,et al.  A constant-factor approximation algorithm for the multicommodity rent-or-buy problem , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[37]  David P. Williamson,et al.  An efficient approximation algorithm for the survivable network design problem , 1998, Math. Program..

[38]  Carsten Lund,et al.  Proof verification and the hardness of approximation problems , 1998, JACM.

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

[40]  Piotr Indyk,et al.  On page migration and other relaxed task systems , 1997, SODA '97.

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

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

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

[44]  R. Ravi,et al.  On the Integrality Gap of a Natural Formulation of the Single-Sink Buy-at-Bulk Network Design Problem , 2001, IPCO.

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

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

[47]  Chaitanya Swamy,et al.  Primal-Dual Algorithms for Connected Facility Location Problems , 2002, APPROX.

[48]  Chaitanya Swamy,et al.  Network design for information networks , 2005, SODA '05.

[49]  Éva Tardos,et al.  Cost Sharing and Approximation , 2005 .

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

[51]  Philip N. Klein,et al.  A Data Structure for Bicategories, with Application to Speeding up an Approximation Algorithm , 1994, Inf. Process. Lett..

[52]  Éva Tardos,et al.  Group strategy proof mechanisms via primal-dual algorithms , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

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

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

[55]  R. Ravi,et al.  Boosted sampling: approximation algorithms for stochastic optimization , 2004, STOC '04.

[56]  Samir Khuller,et al.  The General Steiner Tree-Star problem , 2002, Inf. Process. Lett..

[57]  Yair Bartal,et al.  On approximating arbitrary metrices by tree metrics , 1998, STOC '98.

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

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

[60]  R. Ravi,et al.  Hedging Uncertainty: Approximation Algorithms for Stochastic Optimization Problems , 2004, Math. Program..