Degree-bounded minimum spanning trees

Discrete Applied Mathematics

Volumn 157, Issue 5, 2009, Pages 960-970

  Jothi, Raja ^a   Raghavachari, Balaji ^b  

^a NATIONAL HEART LUNG AND BLOOD INSTITUTE   (United States)

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

Author keywords

Approximation algorithm; Geometric optimization; Minimum spanning trees; Network design; Spanning trees

Indexed keywords

APPROXIMATION ALGORITHMS; COMPUTATIONAL GEOMETRY;

EUCLIDEAN; EUCLIDEAN PLANES; GEOMETRIC OPTIMIZATION; MINIMUM SPANNING TREE PROBLEMS; MINIMUM SPANNING TREES; MINIMUM WEIGHTS; NETWORK DESIGN; NP HARDNESS; NP-HARD; POLYNOMIAL-TIME; SPANNING TREES;

TREES (MATHEMATICS);

EID: 60649110437     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2008.03.037     Document Type: Article

References (23)

1. Arora S. Polynomial-time approximation schemes for euclidean traveling salesman and other geometric problems. Journal of the ACM 45 (1998) 753-782
2. Arora S. Approximation schemes for NP-hard geometric optimization problems: A survey. Mathematical Programming 97 (2003) 43-69
3. Arora S., and Chang K.L. Approximation schemes for degree-restricted MST and red-blue separation problem. Algorithmica 40 (2004) 189-210
4. Chan T. Euclidean bounded-degree spanning tree ratios. Discrete & Computational Geometry 32 (2004) 177-194
5. Chaudhuri K., Rao S., Riesenfeld S., and Talwar K. What would Edmonds to? augment paths and witnesses for degree-bounded MSTs. Proceedings of the APPROX-RANDOM (2005) 26-39
6. N. Christofides, Worst-case analysis of a new heuristic for the traveling salesman problem, Technical Report 388, Grad. School of Industrial Administration, Carnegie-Mellon University, PA, 1975
7. Das G., and Heffernan P.J. Constructing degree-3 spanners with other sparseness properties. International Journal of Foundations of Computer Science 7 (1996) 121-136
8. Fekete S.P., Khuller S., Klemmstein M., Raghavachari B., and Young N. A network-flow technique for finding low-weight bounded-degree spanning trees. Journal of Algorithms 24 (1997) 310-324
9. T. Fischer, Optimizing the degree of minimum weight spanning trees, Technical Report 93-1338, Department of Computer Science, Cornell University, April 1993
10. Fürer M., and Raghavachari B. Approximating the minimum-degree Steiner tree to within one of optimal. Journal of Algorithms 17 (1994) 409-423
11. Garey M.R., and Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-completeness (1979), W.H. Freeman, San Francisco
12. M.X. Goemans, Minimum bounded degree spanning trees, in: Proceedings of the 47th IEEE Symposium on Foundations of Computer Science, FOCS, 2007, pp. 273-282
13. Itai A., Papadimitriou C.H., and Szwarcfiter J.L. Hamilton paths in grid graphs. SIAM Journal on Computing 11 (1982) 676-686
14. R. Jothi, B. Raghavachari, Low-degree minimum spanning trees, Technical Report UTDCS-05-03, Deptartment of Computer Science, University of Texas at Dallas, TX, February 2003
15. Khuller S., Raghavachari B., and Young N. Low-degree spanning trees of small weight. SIAM Journal on Computing 25 (1996) 355-368
16. Könemann J., and Ravi R. A matter of degree: Improved approximation algorithms for degree-bounded minimum spanning trees. SIAM Journal on Computing 31 (2002) 1783-1793
17. Könemann J., and Ravi R. Primal-dual meets local search: Approximating MSTs with nonuniform degree bounds. SIAM Journal on Computing 34 (2005) 763-773
18. Mitchell J.S.B. Guillotine subdivisions approximate polygonal subdivisions: Part II - a simple polynomial-time approximation scheme for geometric TSP, k-MST, and related problems. SIAM Journal on Computing 28 (1999) 1298-1309
19. Monma C., and Suri S. Transitions in geometric minimum spanning trees. Discrete & Computational Geometry 8 (1992) 265-293
20. Papadimitriou C.H., and Vazirani U.V. On two geometric problems related to the traveling salaesman problem. Journal of Algorithms 5 (1984) 231-246
21. Ravi R., Marathe M.V., Ravi S.S., Rosenkrantz D.J., and Hunt III H.B. Approximation algorithms for degree-constrained minimum-cost network-design problems. Algorithmica 31 (2001) 58-78
22. Robins G., and Salowe J.S. Low-degree minimum spanning trees. Discrete & Computational Geometry 14 (1995) 151-166
23. Salowe J.S. Euclidean spanner graphs with degree four. Discrete Applied Mathematics 54 (1994) 55-56