Cost-distance: two metric network design

Presents the cost-distance problem, which consists of finding a Steiner tree which optimizes the sum of edge costs along one metric and the sum of source-sink distances along an unrelated second metric. We give the first known O(log k) randomized approximation scheme for the cost-distance problem, where k is the number of sources. We reduce several common network design problems to cost-distance problems, obtaining (in some cases) the first known logarithmic approximation for them. These problems include a single-sink buy-at-bulk problem with variable pipe types between different sets of nodes, facility location with buy-at-bulk-type costs on edges, constructing single-source multicast trees with good cost and delay properties, and multi-level facility location. Our algorithm is also easier to implement and significantly faster than previously known algorithms for buy-at-bulk design problems.

[1]  D. Peleg,et al.  Approximating shallow-light trees , 1997, SODA '97.

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

[3]  K. Bharath-Kumar,et al.  Routing to Multiple Destinations in Computer Networks , 1983, IEEE Trans. Commun..

[4]  Kamesh Munagala,et al.  Extending Greedy Multicast Routing to Delay Sensitive Applications , 2002, Algorithmica.

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

[6]  Sudipto Guha,et al.  Improved combinatorial algorithms for the facility location and k-median problems , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[7]  Heesang Lee,et al.  An efficient multicast routing algorithm for delay-sensitive applications with dynamic membership , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

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

[9]  Samir Khuller,et al.  Greedy strikes back: improved facility location algorithms , 1998, SODA '98.

[10]  Joseph Naor,et al.  Resource optimization in QoS multicast routing of real-time multimedia , 2000, IEEE/ACM Transactions on Networking.

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

[12]  Kamesh Munagala,et al.  Balancing Steiner trees and shortest path trees online , 2000, SODA '00.

[13]  Vijay V. Vazirani,et al.  Primal-dual approximation algorithms for metric facility location and k-median problems , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

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

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

[16]  Guy Kortsarz,et al.  Approximating Shallow-Light Trees (Extended Abstract) , 1997, SODA.

[17]  R. Ravi,et al.  Bicriteria Network Design Problems , 1998, J. Algorithms.

[18]  Gabriel Robins,et al.  New performance-driven FPGA routing algorithms , 1996, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[19]  Sudipto Guha,et al.  Rounding via Trees : Deterministic Approximation Algorithms forGroup , 1998 .

[20]  L. Wei,et al.  The trade-offs of multicast trees and algorithms , 1994 .

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

[22]  Noga Alon,et al.  On-line steiner trees in the Euclidean plane , 1992, SCG '92.

[23]  Karen Aardal,et al.  A 3-Approximation Algorithm for the k-Level Uncapacitated Facility Location Problem , 1999, Inf. Process. Lett..

[24]  Baruch Awerbuch,et al.  Cost-sensitive analysis of communication protocols , 1990, PODC '90.

[25]  Qing Zhu,et al.  An iterative algorithm for delay-constrained minimum-cost multicasting , 1998, TNET.

[26]  David B. Shmoys,et al.  Approximation algorithms for facility location problems , 2000, APPROX.

[27]  Ian M. Leslie,et al.  How bad is naive multicast routing? , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.

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

[29]  Karen Aardal,et al.  On the Two-Level Uncapacitated Facility Location Problem , 1996, INFORMS J. Comput..

[30]  Sudipto Guha,et al.  Approximating a finite metric by a small number of tree metrics , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[31]  D. Tcha,et al.  A branch-and-bound algorithm for the multi-level uncapacitated facility location problem , 1984 .

[32]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

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

[34]  Pierre Hansen,et al.  A Plant and Warehouse Location Problem , 1977 .

[35]  George C. Polyzos,et al.  Multicast routing for multimedia communication , 1993, TNET.

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

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

[38]  Tony J. Van Roy,et al.  A Dual-Based Procedure for Dynamic Facility Location , 1982 .