Survivable network design: The capacitated minimum spanning network problem

Information Processing Letters

Volumn 91, Issue 4, 2004, Pages 183-190

  Jothi, Raja ^a   Raghavachari, Balaji ^a  

^a The University of Texas at Dallas   (United States)

Author keywords

2 connectivity; Access network design; Approximation algorithms; Combinatorial optimization

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; PROBLEM SOLVING; TREES (MATHEMATICS);

2-CONNECTIVITY; ACCESS NETWORK DESIGN; APPROXIMATION ALGORITHMS; COMBINATORIAL APPROXIMATION;

INFORMATION THEORY;

EID: 3042830053     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2004.04.007     Document Type: Article

References (17)

1. Ahuja R.K., Orlin J.B., Sharma D. A composite neighborhood search algorithm for the capacitated minimum spanning tree problem. Oper. Res. Lett. 31:2003;185-194.
2. Altinkemer K., Gavish B. Heuristics for unequal weight delivery problems with a fixed error guarantee. Oper. Res. Lett. 6:1987;149-158.
3. Altinkemer K., Gavish B. Heuristics with constant error guarantees for the design of tree networks. Management Sci. 34:1988;331-341.
4. Amberg A., Domschke W., Vo ß S. Capacitated minimum spanning trees: Algorithms using intelligent search. J. Comb. Optim. Theory and Practice. 1:1996;9-39.
5. N. Christofides, Worst case analysis of a new heuristic for the traveling salesman problem, Tech. report GSIA, Carnegie-Mellon Univ., 1976.
6. Esau L.R., Williams K.C. On teleprocessing system design. IBM Sys. J. 5:1966;142-147.
7. Frederickson G.N., JáJá J. On the relationship between the biconnectivity augmentation and traveling salesman problems. Theoret. Comput. Sci. 19:(2):1982;189-201.
8. Gavish B., Altinkemer K. Parallel savings heuristics for the topological design of local access tree networks. Proc. IEEE INFOCOM. 1986;130-139.
9. Jothi R., Raghavachari B. Design of local access networks. Proc. of 15th IASTED Internat. Conf. on Parallel and Distributed Computing and Systems (PDCS). 2003;883-888.
10. R. Jothi, B. Raghavachari, Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design, in: Proc. 31st International Colloquium on Automata, Languages and Programming (ICALP), 2004, in press.
11. Khuller S., Vishkin U. Biconnectivity approximations and graph carvings. J. ACM. 41:1994;214-235.
12. J. Orlin, Personal communication, MIT, 2003.
13. Papadimitriou C.H. The complexity of the capacitated tree problem. Networks. 8:1978;217-230.
14. Salman F.S., Cheriyan J., Ravi R., Subramanian S. Buy-at-bulk network design: Approximating the single-sink edge installation problem. Proc. of Symp. on Discrete Algorithms (SODA). 1997;619-628.
15. Sharaiha Y.M., Gendreau M., Laporte G., Osman I.H. A tabu search algorithm for the capacitated shortest spanning tree problem. Networks. 29:1997;161-171.
16. D. Sharma, Personal communication, University of Michigan, Ann Arbor, 2003.
17. Vo ß S. Capacitated minimum spanning trees. Floudas C.A., Pardalos P.M. Encyclopedia of Optimization. vol. 1:2001;225-235 Kluwer, Boston.