Buy-at-bulk network design

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 1997, Pages 542-547

  Awerbuch, Baruch ^a   Azar, Yossi ^a  

^a JOHNS HOPKINS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BANDWIDTH; GRAPH THEORY; PROBLEM SOLVING; RANDOM PROCESSES;

BUY AT BULK NETWORK DESIGN PROBLEMS; EUCLIDIAN GRAPHS; GENERALIZED STEINER CONNECTIVITY; PRIZE COLLECTING SALESMAN (KMST) PROBLEMS;

TELECOMMUNICATION NETWORKS;

EID: 0031331683     PISSN: 02725428     EISSN: None     Source Type: None    
DOI: 10.1109/SFCS.1997.646143     Document Type: Conference Paper

References (15)

1. A. Agrawal P. Klein E. Ravi When trees collide: An approximation algorithm for the generalized Steiner problem in networks Proceedings of the 23rd ACM Symposium on Theory of Computing 134 144 Proceedings of the 23rd ACM Symposium on Theory of Computing 1991
2. N. Alon R. M. Karp D. Peleg D. West A graph-theoretic game and its applications to the k-server problem SIAM J. on Computing 24 78 100 1995
3. B. Awerbuch Y. Azar A. Blum S. Vempala Improved approximation guarantees for minimum-weight K-trees and prize-collecting salesmen Proc. 27th ACM Symp. on Theory of Computing 277 283 Proc. 27th ACM Symp. on Theory of Computing 1995
4. Y. Azar Y. Bartal E. Feuerstein A. Fiat S. Leonardi A. Rosen On capital investment Proceedings of ICALP 96 Proceedings of ICALP 1996
5. E. Balas The prize collecting traveling salesman problem Networks 19 621 636 1989
6. Y. Bartal Probabilistic approximations of metric spaces and its algorithmic applications Proc. 37th IEEE Symp. on Found. of Comp. Science Proc. 37th IEEE Symp. on Found. of Comp. Science 1997
7. A. Blum R. Ravi S. Vempala A constant-factor approximation algorithm for the k-mst problem Proc. 28th ACM Symp. on Theory of Computing 442 448 Proc. 28th ACM Symp. on Theory of Computing 1996
8. N. Garg D. Hochbaum An o(log k) approximation algorithm for the k minimum spanning tree problem in the plane Proceedings of the 26th Annual ACM Symposium on Theory of Computing 432 438 Proceedings of the 26th Annual ACM Symposium on Theory of Computing 1994
9. M. Goemans D. Williamson General approximation technique for constrained forest problems Proceedings of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms 307 315 Proceedings of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms 1992
10. B. L. Golden L. Levy R. Vohra The orienteering problem Naval Research Logistics 34 307 318 1987
11. G. S. Lueker Two np-complete problems in non-negative integer programming CS-178 1975 NJ, Princeton Princeton University
12. Y. Mansour D. Peleg An approximation algorithm for minimum-cost network design CS94-22 1994 Israel, Rehovot The Weizman Institute of Science
13. R. Ravi R. Sundaram M. V. Marathe D. J. Rosenkrantz S. S. Ravi Spanning trees short and small Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms 1994
14. F. S. Salman J. Cheriyan R. Ravi S. Subramanian Buy-at-bulk network design:approximating the single-sink edge installation problem Proc. 8th ACM-SIAM Symp. on Discrete Algorithms Proc. 8th ACM-SIAM Symp. on Discrete Algorithms 1997