Approximation algorithms for a capacitated network design problem

We study a network loading problem with applications in local access network design. Given a network, the problem is to route flow from several sources to a sink and to install capacity on the edges to support flows at minimum cost. Capacity can be purchased only in multiples of a fixed quantity. All the flow from a source must be routed in a single path to the sink. This NP-hard problem generalizes the Steiner tree problem and also more effectively models the applications traditionally formulated as capacitated tree problems. We present an approximation algorithm with performance ratio (ρST +2) where ρST is the performance ratio of any approximation algorithm for minimum Steiner tree. When all sources have the same demand value, the ratio improves to (ρST +1) and in particular, to 2 when all nodes in the graph are sources.

[1]  Luca Trevisan,et al.  Improved Non-approximability Results for Minimum Vertex Cover with Density Constraints , 1999, Electron. Colloquium Comput. Complex..

[2]  Christos H. Papadimitriou,et al.  The complexity of the capacitated tree problem , 1978, Networks.

[3]  Hans Jürgen Prömel,et al.  RNC-Approximation Algorithms for the Steiner Problem , 1997, STACS.

[4]  David S. Johnson,et al.  The Rectilinear Steiner Tree Problem is NP Complete , 1977, SIAM Journal of Applied Mathematics.

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

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

[7]  Luca Trevisan,et al.  Improved Non-approximability Results for Vertex Cover with Density Constraints , 1996, COCOON.

[8]  Rakesh Kawatra,et al.  A multiperiod planning model for the capacitated minimal spanning tree problem , 2000, Eur. J. Oper. Res..

[9]  Samir Khuller,et al.  Balancing Minimum Spanning and Shortest Path Trees , 1993, SODA.

[10]  Hans Jürgen Prömel,et al.  A 1.598 approximation algorithm for the Steiner problem in graphs , 1999, SODA '99.

[11]  Mauro Dell'Amico,et al.  Annotated Bibliographies in Combinatorial Optimization , 1997 .

[12]  Lisa Zhang,et al.  The access network design problem , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

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

[14]  David Peleg,et al.  An approximation algorithm for minimum-cost network design , 1994, Robust Communication Networks: Interconnection and Survivability.

[15]  Bezalel Gavish,et al.  Topological design of telecommunication networks-local access design methods , 1991, Ann. Oper. Res..

[16]  Samir Khuller,et al.  Balancing minimum spanning and shortest path trees , 1993, SODA '93.

[17]  R. Sharma.  Design of an Economical Multidrop Network Topology with Capacity Constraints , 1983, IEEE Trans. Commun..

[18]  K. Mani Chandy,et al.  The Capacitated Minimum Spanning Tree , 1973, Networks.

[19]  Aaron Kershenbaum,et al.  Centralized teleprocessing network design , 1976, Networks.

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

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

[22]  Brunilde Sansò,et al.  Telecommunications Network Planning , 1998 .

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

[24]  B. Gavish,et al.  Heuristics with Constant Error Guarantees for the Design of Tree Networks , 1988 .

[25]  R. Ravi,et al.  Buy-at-bulk network design: approximating the single-sink edge installation problem , 1997, SODA '97.

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