Approximation algorithms for access network design

Algorithmica (New York)

Volumn 34, Issue 2, 2002, Pages 197-215

  Andrews, Matthew ^a   Zhang, Lisa ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

Access network design; Approximation algorithms; Economies of scale; LP rounding; Primal dual algorithm

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; COSTS; INTEGER PROGRAMMING; LINEAR PROGRAMMING; POLYNOMIAL APPROXIMATION; SYSTEMS ANALYSIS; TELECOMMUNICATION TRAFFIC;

NETWORK DESIGNINGS;

COMPUTER SCIENCE;

EID: 0141991875     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-002-0968-3     Document Type: Article

References (13)

1. B. Awerbuch and Y. Azar. Buy-at-bulk network design. In Proceedings of the 38th Annual Symposium on Foundations of Computer Science, pages 542-547, Miami Beach, FL, October 1997.
2. Y. Bartal. Probabilistic approximation of metric spaces and its algorithmic applications. In Proceedings of the 37th Annual Symposium on Foundations of Computer Science, pages 184-193, Burlington, VT, October 1996.
3. Y. Bartal. On approximating arbitrary metrics by tree metrics. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing, pages 161-168, Dallas, TX, May 1998.
4. M. Charikar, C. Chekuri, A. Goel, and S. Guha. Rounding via trees: deterministic approximation algorithms for group steiner trees and k median. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing, pages 114-123, Dallas, TX, May 1998.
5. M. Charikar, C. Chekuri, A. Goel, S. Guha, and S. Plotkin. Approximating a finite metric by a small number of tree metrics. In Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science, Palo Alto, CA, November 1998.
6. M. Goemans and D. Williamson. The primal-dual method for approximation algorithms and its application to network design problems. In Approximation Algorithms for NP-Hard Problems, D. Hochbaum, ed., pages 144-191, PWS, Boston, MA, 1995.
7. K. Jain and V. Vazirani. Primal dual approximation algorithms for metric facility location and k-median problems. In Proceedings of the 39th Annual Symposium on Foundations of Computer Science, pages 2-13, New York, October 1990.
8. J. Lin and J. S. Vitter. ε-Approximations with minimum packing constraint violation. In Proceedings of the 24th Annual ACM Symposium on Theory of Computing, pages 771-782, Victoria, B.C., May 1992.
9. Y. Mansour and D. Peleg. An approximation algorithm for minimum-cost network design. Technical Report CS94-22, The Weizmann Institute of Science, Rehovot, 1994.
10. A. Meyerson, K. Munagala, and S. Plotkin. Cost-distance: two metric network design. Technical Report STAN-CS-TN-00-92, Stanford University, Palo Alto, CA, 2000.
11. F. S. Salman, J. Cheriyan, R. Ravi, and S. Subramanian. Buy at bulk network design: approximating the single-sink edge installation problem. In Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 619-628, New Orleans, LA, January 1997.
12. D. B. Shmoys, E. Tardos, and K. Aardal. Approximation algorithms for facility location problems. In Proceedings of the 29th Annual ACM Symposium on Theory of Computing, pages 265-274, El Paso, TX, May 1997.
13. A. Srinivasan and C. Teo. A constant-factor approximation algorithm for packet routing, and balancing local vs. global criteria. In Proceedings of the 29th Annual ACM Symposium on Theory of Computing, pages 636-643, El Paso, TX, May 1997.