Approximation algorithms for a capacitated network design problem

Algorithmica (New York)

Volumn 38, Issue 3, 2003, Pages 417-431

  Hassin, Refael ^a   Ravi, R ^b   Salman, F Sibel ^c  

^a TEL AVIV UNIVERSITY   (Israel)

^b CARNEGIE MELLON UNIVERSITY   (United States)

^c PURDUE UNIVERSITY   (United States)

Author keywords

Approximation algorithms; Capacity installation; Network design; Routing flow

Indexed keywords

APPROXIMATION THEORY; COST EFFECTIVENESS; FIBER OPTICS; MATHEMATICAL MODELS; PROBLEM SOLVING; RELIABILITY; TELECOMMUNICATION NETWORKS;

APPROXIMATION ALGORITHMS; CAPACITY INSTALLATION; LOCAL ACCESS NETWORKS; NETWORK DESIGN; ROUTING FLOW;

ALGORITHMS;

EID: 21044445619     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-003-1069-7     Document Type: Article

References (26)

1. [AG] K. Altinkemer and B. Gavish, Heuristics with constant error guarantees for the design of tree networks. Management Sci., 34, 331-341, 1988.
2. [AZ] M. Andrews and L. Zhang, Approximation algorithms for access network design, Algorithmica, 34, 197-215, 2002.
3. [BP] M. Bern and P. Plassmann, The Steiner tree problem with edge lengths 1 and 2. Inform. Process. Lett., 32, 171-176, 1989.
4. [BR] P. Berraan and V. Ramaiyer, Improved approximations for the Steiner tree problem, J. Algorithms, 17, 381-408, 1994.
5. [CL] K. M. Chandy and T. Lo, The capacitated minimum tree, Networks, 3, 173-182, 1973.
6. [CT] A. Clementi and L. Trevisan, Improved non-approximability results for minimum vertex cover with density constraints, Proc. of the 2nd Computing and Combinatorics Conference, COCOON '96, pp. 333-342, Springer Verlag, Berlin, 1996.
7. [DMM] M. Dell'Amico, F. Maffioli and S. Martello, Editors, Annotated Bibliographies in Combinatorial Optimization, Wiley-Interscience, New York, 1997.
8. [G] B. Gavish, Topological design of telecommunication networks - local access design methods, Ann. Oper. Res., 33, 17-71, 1991.
9. [GJ] M. R. Garey and D. S. Johnson, The rectilinear Steiner tree problem is NP-complete, SIAM J. Appl. Math., 32, 826-834, 1977.
10. +] N. Garg, R. Khandekar, G. Konjevod, R. Ravi, F. S. Salman, and A. Sinha, On the integrality gap of a natural formulation of the single-sink buy-at-bulk network design problem, Proceedings of the &th International Integer Programming and Combinatorial Optimization Conference, pp. 170-184. LNCS 2081, Springer-Verlag, Berlin, 2001.
11. [HP] S. Hougardy and H. J. Prömmel, A 1.598 approximation algorithm forthe Steiner problem in graphs. Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 448-453, 1999.
12. [KB1] A. Kershenbaum and R. Boorstyn, Centralized teleprocessing network design, Networks, 13, 279-293, 1983.
13. [KB2] R. Kawatra and D. L. Bricker, A multiperiod planning model for the capacitated minimal spanning tree problem, European J. Oper. Res., 121, 412-419, 2000.
14. [KRY] S. Khuller, B. Raghavachari and N. E. Young, Balancing minimum spanning and shortest path trees, Algorithmica, 14, 305-322, 1993.
15. [KZ] M. Karpinsky and A. Zelikovsky, New approximation algorithms for the Steiner tree problem, J. Combin. Optim., 1, 47-65, 1997.
16. [MP] Y. Mansour and D. Peleg, An approximation algorithm for minimum-cost network design, Tech. Report CS94-22, The Weizman Institute of Science, Rehovot, 1994:
17. also presented at the DIMACS Workshop on Robust Communication Networks, 1998.
18. [P] C. H. Papadimitriou, The complexity of the capacitated tree problem, Netoorks, 8, 217-230, 1978.
19. [PS] H. J. Prömmel and A. Steger, RNC-approximation algorithms for the Steiner problem. Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science, pp. 559-570, 1997.
20. [RZ] G. Robins and A. Zelikovsky, Improved steiner tree approximation in graphs, Proceedings of the 10th Annual ACM-SIAM Svmposium on Discrete Algorithms, pp. 770-779, 2000.
21. [S] R. L. Sharma, Design of an economical multidrop network topology with capacity constraints, IEEE Trans. Comm., 31, 590-591, 1983.
22. +] F. S. Salman, J. Cheriyan, R. Ravi and S. Subramanian, Approximating the single-sink link-installation problem in network design, SIAM J. Optim., 11, 595-610, 2000.
23. [SRH] F. S. Salman, R. Ravi and J. Hooker, Solving the local access network design problem, Working paper, 2000.
24. [SS] B. Sanso and P. Soriano, Editors, Telecommunications Network Planning, Kluwer Academic, Dordrecht, 1999.
25. [TM] H. Takahashi and A. Matsuyama, An approximate solution for the Steiner problem in graphs, Math. Japon., 24, 573-577, 1980.
26. [Z] A. Zelikovsky, An 11/6-approximation algorithm for the network Steiner problem, Algorithmica, 9, 463-470, 1993.