A network-flow technique for finding low-weight bounded-degree spanning trees

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1084, Issue , 1996, Pages 105-117

  Fekete, Sándor P ^a   Khuller, Samir ^b   Klemmstein, Monika ^a   Raghavachari, Balaji ^c   Young, Neal ^d  

^a UNIVERSITY OF COLOGNE   (Germany)

^b UNIVERSITY OF MARYLAND   (United States)

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

^d Dartmouth College   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; CLUSTERING ALGORITHMS; COMBINATORIAL OPTIMIZATION; GRAPH ALGORITHMS; GRAPH STRUCTURES; INTEGER PROGRAMMING;

LINEAR-TIME ALGORITHMS; MINIMUM SPANNING TREES; NETWORK FLOW TECHNIQUES; NETWORK-FLOW-BASED ALGORITHM; PERFORMANCE GUARANTEES; TRAVELING SALESMAN; TRIANGLE INEQUALITY; WORST-CASE PERFORMANCE;

TREES (MATHEMATICS);

EID: 84947997142     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61310-2_9     Document Type: Conference Paper

References (21)

1. R. K. Ahuja, T. L. Magnanti and J. B. Orlin. Network flows (theory, algorithms and applications). Prentice Hall, Englewood Cliffs, NJ, 1993.
2. C. Brezovec, G. Cornuéjols, F. Glover. A matroid algorithm and its application to the efficient solution of two optimization problems in graphs. Math. Programming 42 (1988), pp. 471-487.
3. T. Fischer. Optimizing the degree of minimum weight spanning trees. Tech. Rep. 93-1338, Dept, of Computer Science, Cornell University, April 1993.
4. M. Fürer and B. Raghavachari. Approximating the minimum-degree Steiner tree to within one of optimal. J. Algorithms 17 (1994), pp. 409-423.
5. H. N. Gabow. A good algorithm for smallest spanning trees with a degree constraint. Networks 8 (1978), pp. 201-208.
6. H. N. Gabow and R. E. Tarjan. Efficient algorithms for a family of matroid intersection problems. J. Algorithms 5 (1984), pp. 80-131.
7. M. R. Garey and D. S. Johnson. Computers and intractability: a guide to the theory of NP-completeness. Freeman, San Francisco, CA, 1979.
8. B. Gavish. Topological design of centralized computer networks-formulations and algorithms. Networks 12 (1982), pp. 355-377.
9. F. Glover, D. Klingman. Finding minimum spanning trees with a fixed number of links at a node. In: B. Roy (ed.), Combinatorial Programming: Methods and Applications. D. Reidel Publishing Company, Dordrecht-Holland, 1975. pp. 191-201.
10. S. Khuller, B. Raghavachari and N. Young. Low degree spanning trees of small weight. Proc. of 26th Annual ACM Symp. on the Theory of Computing, pp. 412-421, May 1994. To appear in SIAM J. Comput.
11. S. Khuller, B. Raghavachari, N. Young, Balancing minimum spanning trees and shortest-path trees. Algorithmica 14 (1995), pp. 305-321.
12. C. L. Monma, D. Shallcross. Methods for designing communication networks with certain two-connected survivability constraints. Oper. Res. 37 (1989), pp. 531-541.
13. C. L. Monma, S. Suri, Transitions in geometric minimum spanning trees. Discrete & Computational Geometry 8 (1992), pp. 265-293.
14. S. C. Narula and C. A. Ho. Degree-constrained minimum spanning tree. Comput. Ops. Res. 7 (1980), pp. 239-249.
15. C. H. Papadimitriou, U. V. Vazirani, On two geometric problems related to the traveling salesman problem. J. Algorithms 5 (1984), pp. 231-246.
16. R. Ravi, M. V. Marathe, S. S. Ravi, D. J. Rosenkrantz and H. B. Hunt III. Many birds with one stone: multi-objective approximation algorithms. Manuscript. A preliminary version appeared in Proc. 25th Annual ACM Symp. on the Theory of Computing, pp. 438-447, May 1993.
17. G. Robins and J. S. Salowe. Low-degree minimum spanning trees. Discrete and Computational Geometry 14 (1995), pp. 151-166.
18. J. S. Salowe. Euclidean spanner graphs with degree four. Discrete Appl. Math. 54 (1994), pp. 55-66.
19. M. Savelsbergh and A. Volgenant. Edge exchanges in the degree-constrained minimum spanning tree problem. Comput. Ops. Res. 12 (1985), pp. 341-348.
20. M. Stoer. Design of survivable networks. Lecture Notes on Mathematics # 1531. Springer, Heidelberg, 1992.
21. A. Volgenant. A Lagrangean approach to the degree-constrained minimum spanning tree problem. Europ. J. Ops. Res. 39 (1989), pp. 325-331.