On the approximability of some network design problems

ACM Transactions on Algorithms

Volumn 4, Issue 2, 2008, Pages

  Chuzhoy, Julia ^a,e   Gupta, Anupam ^b,f   Naor, J ^c   Sinha, Amitabh ^d,g  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

^c TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^d UNIVERSITY OF MICHIGAN   (United States)

^e TOYOTA TECHNOLOGICAL INSTITUTE AT CHICAGO   (United States)

^f Carnegie Mellon University   (United States)

^g UNIVERSITY OF MICHIGAN   (United States)

Author keywords

Cost distance; Fixed charge network flow; Hardness of approximation; Network design; Priority Steiner tree

Indexed keywords

APPROXIMABILITY; NETWORK DESIGN PROBLEM (NPD); TERMINALS (AIRPORT);

ARCHITECTURAL DESIGN; COMPUTER NETWORKS; MASS TRANSPORTATION; NETWORK PROTOCOLS;

METROPOLITAN AREA NETWORKS;

EID: 44849085750     PISSN: 15496325     EISSN: 15496333     Source Type: Journal    
DOI: 10.1145/1361192.1361200     Document Type: Article

References (41)

1. ANDREWS, M. 2004. Hardness of buy-at-bulk network design. In Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science. 115-124.
2. ANDREWS, M., AND ZHANG, L. 2002. Approximation algorithms for access network design. Algorithmica 34, 2, 197-215.
3. ARORA, S., LUND, C., MOTWANI, R., SUDAN, M., AND SZEGEDY, M. 1998. Proof verification and the hardness of approximation problems. J. ACM 45, 3, 501-555.
4. AWERBUCH, B., AND AZAR, Y. 1997. Buy-at-bulk network design. In Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science. 542-547.
5. CARR, R. D., FLEISCHER, L., LEUNG, V. J., AND PHILLIPS, C. A. 2000. Strengthening integrality gaps for capacitated network design and covering problems. In Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete. 106-115.
6. CHARIKAR, M., NAOR, J. S., AND Schieber, B. 2004. Resource optimization in QoS multicast routing of real-time multimedia. IEEE/ACM Trans. Netw. 12, 2, 340-348.
7. CHEKURI, C., KHANNA, S., AND NAOR, J. S. 2001. A deterministic algorithm for the cost-distance problem. In Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms. 232-233.
8. CLEMENTI, A. E., AND TREVISAN, L. 1999. Improved non-approximability results for minimum vertex cover with density constraints. Theor. Comput. Sci. 225, 1-2, 113-128.
9. CURRENT, J. R., REVELLE, C. S., AND COHON, J. L. 1986. The hierarchical network design problem. European J. Oper. Resear. 27, 57-66.
10. DUIN, C., AND VOLGENANT, T. 1991. The multi-weighted Steiner tree problem. Ann. Oper. Resear. 33, 1-4, 451-469. Topological network design (Copenhagen, 1989).
11. EVEN, G., KORTSARZ, G., AND SLANY, W. 2002. On network design: Fixed charge flows and the covering steiner problem. In Proceedings of the 8th Scandinavian Workshop on Algorithm Theory. Lecture Notes in Computer Science, vol. 2368, Springer, 318-329.
12. FAKCHAROENPHOL, J., RAO, S., AND TALWAR, K. 2003. A tight boundon approximating arbitrary metrics by tree metrics. In Proceedings of the 35th Annual ACM Symposium on Theory of Computing. 448-455.
13. GARG, N., KHANDEKAR, R., KONJEVOD, G., RAVI, R., SALMAN, F. S., AND SINHA, A. 2001. 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. Lecture Notes in Computer Science, vol. 2081, 170-184.
14. GOEMANS, M. X., AND WILLIAMSON, D. P. 1997. The primal-dual method for approximation algorithms and its application to network design problems. In Approximation Algorithms for NP-hard Problems, D. S. Hochbaum, Ed. PWS Publishing.
15. GUHA, S., AND KHULLER, S. 1999. Greedy strikes back: Improved facility location algorithms. J. Algor. 31, 1, 228-248.
16. GUHA, S., MEYERSON, A., AND MUNAGALA, K. 2000. Hierarchical placement and network design problems. In Proceedings of the 41th Annual IEEE Symposium on Foundations of Computer Science. 603-612.
17. GUHA, S., MEYERSON, A., AND MUNGALA, K. 2001. 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). 383-388.
18. GUNLUK, O. 1999. A branch-and-cut algorithm for capacitated network design problems. Math. Program. 86, 17-39.
19. GUPTA, A., KUMAR, A., PÁL, M., AND ROUGHGARDEN, T. 2003a. Approximations via cost-sharing. In Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science. 606-615.
20. GUPTA, A., KUMAR, A., AND ROUGHGARDEN. 2003b. Simpler and better approximation algorithms for network design. In Proceedings of the 35th Annual ACM Symposium on Theory of Computing. 365-372.
21. HALPERIN, E., AND KRAUTHGAMER, R. 2003. Polylogarithmic inapproximability. In Proceedings of the 35th Annual ACM Symposium on Theory of Computing. 585-594.
22. JAIN, K. 2001. A factor 2 approximation algorithm for the generalized Steiner network problem. Combinatorica 21, 1, 39-60.
23. KARGER, D. R., AND MINKOFF, M. 2000. Building Steiner trees with incomplete global knowledge. In Proceedings of the 41th Annual IEEE Symposium on Foundations of Computer Science. 613-623.
24. KUMAR, A., GUPTA, A., AND ROUGHGARDEN, T. 2002. A constant-factor approximation algorithm for the multicommodity rent-or-buy problem. In Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science. 333-342.
25. LUND, C., AND YANNAKAKIS, M. 1994. On the hardness of approximating minimization problems. J. ACM 41, 5, 960-981.
26. MARATHE, M. V., RAVI, R., SUNDARAM, R., RAVI, S. S., ROSENKRANTZ, D. J., AND HUNT, III, H. B. 1998. Bicriteria network design problems. J. Algor. 28, 1, 142-171.
27. MAXEMCHUK, N. F. 1997. Video distribution on multicast networks. IEEE J. Select. Areas Comm. 15, 357-372.
28. MELKONIAN, V., AND TARDOS, É. 1999. Approximation algorithms for a directed network design problem. Lecture Notes in Comput. Sci., vol. 1610, Springer, 345-360.
29. MEYERSON, A. 2004. Online algorithms for network design. In Proceedings of the 16th ACM Symposium on Parallelism in Algorithms and Architectures. 275-280.
30. MEYERSON, A., MUNAGALA, K., AND PLOTKIN, S. 2000. Cost-distance: Two metric network design. In Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science. 624-630.
31. MIRCHANDANI, P. 1996. The multi-tier tree problem. INFORMS J. Comput. 8, 202-218.
32. NEMHAUSER, G. L., AND WOLSEY, L. A. 1999. Integer and Combinatorial Optimization.Wiley-Inter Science.
33. ORTEGA, F., AND WOLSEY, L. A. 2003. A branch-and-cut algorithm for the single-commodity, uncapacitated, fixed-charge network flow problem. Networks 41, 3, 143-158.
34. PIRKUL, H., CURRENT, J., AND NAGARAJAN, V. 1991. The hierarchical network design problem: a new formulation and solution procedures. Transport. Sci. 25, 175-182.
35. RAVI, R., AND SALMAN, F. S. 1999. Approximation algorithms for the traveling purchaser problem and its variants in network design. Lecture Notes in Computer Science, vol. 1643, Springer, 29-40.
36. RAVI, R., AND SINHA, A. 2002. Integrated logistics: Approximation algorithms combining facility location and network design. In Proceedings of the 9th Integer Programming and Combinatorial Optimization Conference. Lecture Notes in Computer Science, vol. 2337, 212-229.
37. RAZ, R. 1998. A parallel repetition theorem. SIAM J. Comput. 27, 3, 763-803.
38. SALMAN, F. S., CHERIYAN, J., RAVI, R., AND SUBRAMANIAN, S. 2000. Approximating the single-sink link-installation problem in network design. SIAM J. Optimiz. 11, 3, 595-610.
39. SWAMY, C., AND KUMAR, A. 2002. Primal-dual algorithms for the connected facility location problem. In Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX). Lecture Notes in Computer Science, vol. 2462, 256-269.
40. TALWAR, K. 2002. Single-sink buy-at-bulk LP has constant integrality gap. In Proceedings of the 9th Integer Programming and Combinatorial Optimization Conference. Lecture Notes in Computer Science, vol. 2337, 475-486.
41. TURLETTI, T., AND BOLOT, J.-C. 1994. Issues with multicast video distribution in heterogeneous packet networks. In Proceedings of 6th International Workshop on Packet Video.