On the approximability of some network design problems

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2005, Pages 943-951

  Chuzhoy, Julia ^a   Gupta, Anupam ^b   Naor, Joseph ^c   Sinha, Amitabh ^d  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b Carnegie Mellon University   (United States)

^c TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^d UNIVERSITY OF MICHIGAN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; COST FUNCTIONS; NETWORK DESIGN; POLYNOMIAL TIME;

ALGORITHMS; COMBINATORIAL MATHEMATICS; COMPUTER NETWORKS; FREQUENCY ALLOCATION; INTEGRAL EQUATIONS; MATHEMATICAL MODELS; OPERATIONS RESEARCH; PROBLEM SOLVING; QUALITY OF SERVICE; TELECOMMUNICATION TRAFFIC; TREES (MATHEMATICS);

APPROXIMATION THEORY;

EID: 20744439389     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (44)

1. Matthew Andrews. Hardness of buy-at-bulk network design. In Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, 2004.
2. Matthew Andrews and Lisa Zhang. Approximation algorithms for access network design. Algorithmica, 34(2): 197-215, 2002.
3. (Preliminary version in 39th FOCS, 1998.).
4. Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, and Mario Szegedy. Proof verification and the hardness of approximation problems. J. ACM, 45(3):501-555, 1998.
5. Sanjeev Arora and Shmuel Safra. Probabilistic checking of proofs: a new characterization of NP. J. ACM, 45(1):70-122, 1998.
6. Baruch Awerbuch and Yossi Azar. Buy-at-bulk network design. In Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science, pages 542-547, 1997.
7. Robert D. Carr, Lisa Fleischer, Vitus J. Leung, and Cynthia A. Phillips. Strengthening integrality gaps for capacitated network design and covering problems. In Symposium on Discrete Algorithms, pages 106-115, 2000.
8. Moses Charikar, Joseph (Seffi) Naor, and Baruch Schieber. Resource optimization in QoS multicast routing of real-time multimedia. IEEE/ACM Transactions on Networking, 12(2):340-348, 2004.
9. Chandra Chekuri, Sanjeev Khanna, and Joseph (Seffi) Naor. A deterministic algorithm for the cost-distance problem. In Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 232-233, 2001.
10. Andrca E.F. Clementi and Luca Trevisan. Improved non-approximability results for minimum vertex cover with density constraints. Theoretical Computer Science, 225(1-2): 113-128, 1999.
11. J. R. Current, C. S. Revelle, and J. L. Cohon. The hierarchical network design problem. European Journal of Operational Reasearch, 21:51-66, 1986.
12. Cees Duin and Ton Volgenant. The multi-weighted Steiner tree problem. Ann. Oper. Res., 33(1-4):451-469, 1991. Topological network design (Copenhagen, 1989).
13. Guy Even, Guy Kortsarz, and Wolfgang Slany. On network design: fixed charge flows and the covering steiner problem. In Proceedings of the 8th Scandinavian Workshop on Algorithm Theory, volume 2368 of Lecture Notes in Computer Science, pages 318-329. Springer, 2002.
14. Jittat Fakcharoenphol, Satish Rao, and Kunal Talwar. A tight bound on approximating arbitrary metrics by tree metrics. In Proceedings of the 35th Annual ACM Symposium on Theory of Computing, pages 448-455, 2003.
15. Naveen Garg, Rohit Khandekar, Goran Konjevod, R. Ravi, F. Sibel Salman, and Amitabh Sinha. On the integrality gap of a natural formulation of the single-sink buy-at-bulk network design formulation. In Proceedings of the 8th Integer Programming and Combinatorial Optimization Conference, volume 2081 of Lecture Notes in Computer Science, pages 170-184, 2001.
16. Michel X. Goemans and David P. Williamson. The primal-dual method for approximation algorithms and its application to network design problems. In Dont S. Hochbaum, editor, Approximation Algorithms for NP-hard Problems. PWS Publishing, 1997.
17. Sudipto Guha and Samir Khuller. Greedy strikes back: Improved facility location algorithms. Journal of Algorithms, 31(1):228-248, 1999.
18. Sudipto Guha, Adam Meyerson, and Kamesh Munagala. Hierarchical placement and network design problems. In Proceedings of the 41th Annual IEEE Symposium on Foundations of Computer Science, pages 603-612, 2000.
19. Sudipto Guha, Adam Meyerson, and Kamesh Mungala. A constant factor approximation for the single sink edge installation problems. In Proceedings of the 33rd Annual ACM Symposium on the Theory of Computing (STOC), pages 383-388, 2001.
20. Oktay Gunluk. A branch-and-cut algorithm for capacitated network design problems. Mathematical Programming, 86:17-39, 1999.
21. Anupam Gupta, Amit Kumar, Martin Pal, and Tim Rough-garden. Approximations via cost-sharing. In Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, pages 606-615, 2003.
22. Anupam Gupta, Amit Kumar, and Tim Roughgarden. Simpler and better approximation algorithms for network design. In Proceedings of the 35th Annual ACM Symposium on Theory of Computing, pages 365-372, 2003.
23. Eran Halperin and Robert Krauthgamer. Polylogarithmic inapproximability. In Proceedings of the 35th Annual ACM Symposium on Theory of Computing, pages 585-594, 2003.
24. Kamal Jain. A factor 2 approximation algorithm for the generalized Steiner network problem. Combinatorica, 21(1):39-60, 2001.
25. (Preliminary version in 39th FOCS, pages 448-457, 1998).
26. David R. Karger and Maria Minkoff. Building Steiner trees with incomplete global knowledge. In Proceedings of the 41th Annual IEEE Symposium on Foundations of Computer Science, pages 613-623, 2000.
27. Amit Kumar, Anupam Gupta, and Tim Roughgarden. A constant-factor approximation algorithm for the multicom-modity rent-or-buy problem. In Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, pages 333-342, 2002.
28. Carsten Lund and Mihalis Yannakakis. On the hardness of approximating minimization problems. J. Assoc. Comput. Mach., 41 (5):960-981, 1994.
29. Madhav V. Marathe, R. Ravi, Ravi Sundaram, S. S. Ravi, Daniel J. Rosenkrantz, and Harry B. Hunt, III. Bicriteria network design problems. J. Algorithms, 28(1):142-171, 1998.
30. N. F. Maxemchuk. Video distribution on multicast networks. IEEE J. on Selected Areas in Communications, 15:357-372, 1997.
31. Vardges Melkonian and Eva Tardos. Approximation algorithms for a directed network design problem. In Integer programming and combinatorial optimization (Graz, 1999), volume 1610 of Lecture Notes in Comput. Sci., pages 345-360. Springer, Berlin, 1999.
32. Adam Meyerson. Online algorithms for network design. In Proceedings of the 16th ACM Symposium on Parallelism in Algorithms and Architectures, 2004.
33. Adam Meyerson, Kamesh Munagala, and Serge Plotkin. Cost-distance: Two metric network design. In Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science, pages 624-630, 2000.
34. P. Mirchandani. The multi-tier tree problem. INFORMS Journal on Computing, 8:202-218, 1996.
35. George L, Nemhauser and Laurence A. Wolsey. Integer and Combinatorial Optimization. 1999.
36. Francisco Ortega and Laurence A. Wolsey. A branch-and-cut algorithm for the single-commodity, uncapacitated, fixed-charge network flow problem. Networks, 41(3): 143-158, 2003.
37. H. Pirkul, J. Current, and V. Nagarajan. The hierarchical network design problem: a new formulation and solution procedures. Transportation Science, 25:175-182, 1991.
38. R. Ravi and F. S. Salman. Approximation algorithms for the traveling purchaser problem and its variants in network design. In Algorithms - ESA '99 (Prague), volume 1643 of Lecture Notes in Comput. Sci., pages 29-40. Springer, Berlin, 1999.
39. R. Ravi and Amitabh Sinha. Integrated logistics: Approximation algorithms combining facility location and network design. In Proceedings of the 9th Integer Programming and Combinatorial Optimization Conference, volume 2337 of Lecture Notes in Computer Science, pages 212-229, 2002.
40. Ran Raz. A parallel repetition theorem. SIAM J. Comput., 27(3):763-803 (electronic), 1998.
41. F. Sibel Salman, Joseph Cheriyan, R. Ravi, and Sairam Subramanian. Approximating the single-sink link-installation problem in network design. SIAM Journal on Optimization, 11(3):595-610, 2000.
42. Chaitanya Swamy and Amit Kumar. Primal-dual algorithms for the connected facility location problem. In Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), volume 2462 of Lecture Notes in Computer Science, pages 256-269, 2002.
43. Kunal Talwar. Single-sink buy-at-bulk LP has constant integrality gap. In Proceedings of the 9th Integer Programming and Combinatorial Optimization Conference, volume 2337 of Lecture Notes in Computer Science, pages 475-486, 2002.
44. T. Turletti and J.-C. Bolot. Issues with multicast video distribution in heterogeneous packet networks. In Proceedings of 6th International Workshop on Packet Video, 1994.