Low-degree spanning trees of small weight

SIAM Journal on Computing

Volumn 25, Issue 2, 1996, Pages 355-368

  Khuller, Samir ^a   Raghavachari, Balaji ^b   Young, Neal ^c,d  

^a University of Maryland ^*  (United States)

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

^c Dartmouth Department of Computer Science_Dartmouth College   (United States)

^d Department of Obstetrics Gynecology

Author keywords

Algorithms; Approximation algorithms; Geometry; Graphs; Spanning trees

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; COMPUTATIONAL METHODS; GRAPH THEORY; POLYNOMIALS; TREES (MATHEMATICS);

APPROXIMATION ALGORITHMS; HAMILTON PATH PROBLEMS; MINIMUM SPANNING TREES; POLYNOMIAL TIME; SPANNING TREES;

ALGORITHMS;

EID: 0030128523     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539794264585     Document Type: Article

References (21)

1. J. L. BENTLEY, Communicated by David Johnson.
2. D. BIENSTOCK, M. X. GOEMANS, D. SIMCHI-LEVI, AND D. P. WILLIAMSON, A note on the prize collecting traveling salesman problem, Math. Programming, 59 (1993), pp. 413-420.
3. N. CHRISTOFIDES, Worst-case analysis of a new heuristic for the traveling salesman problem, Tech. report 388, Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh, PA, 1975.
4. G. DAS AND P. J. HEFFERNAN, Constructing degree-3 spanners with other sparseness properties, in Proc. 4th Annual International Symposium on Algorithms and Computation, Lecture Notes in Comput. Sci. 762, Springer-Verlag, Berlin, New York, 1993, pp. 11-20.
5. D.-Z. DU AND F. K. HWANG, A proof of the Gilbert-Pollak conjecture on the Steiner ratio, Algorithmica, 7 (1992), pp. 121-136.
6. D.-Z. DU, Y. ZHANG, AND Q. FENG, On better heuristic for Euclidean Steiner minimum trees, in Proc. 32nd Annual Symposium on Foundations of Computer Science, IEEE Press, Piscataway, NJ, 1991, pp. 431-439.
7. T. FISCHER, Optimizing the degree of minimum weight spanning trees, Tech. report 93-1338, Department of Computer Science, Cornell University, April 1993.
8. G. N. FREDERICKSON AND J. JÁJÁ, On the relationship between the biconnectivity augmentation and traveling salesman problems, Theoret. Comput. Sci., 19 (1982), pp. 189-201.
9. M. FÜRER AND B. RAGHAVACHARI, Approximating the minimum-degree Steiner tree to within one of optimal, J. Algorithms, 17 (1994), pp. 409-423.
10. M. R. GAREY AND D. S. JOHNSON, Computers and intractability: A guide to the theory of NP-completeness, W. H. Freeman, San Francisco, 1979.
11. M. X. GOEMANS AND D. P. WILLIAMSON, A general approximation technique for constrained forest problems, in Proc. 3rd Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, Philadelphia, 1992, pp. 307-316; SIAM J. Comput., 24 (1995), pp. 296-317.
12. M. X. GOEMANS AND D. P. WILLIAMSON, A general approximation technique for constrained forest problems, in Proc. 3rd Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, Philadelphia, 1992, pp. 307-316; SIAM J. Comput., 24 (1995), pp. 296-317.
13. A. ITAI, C. H. PAPADIMITRIOU, AND J. L. SZWARCFITER, Hamilton paths in grid graphs, SIAM J. Comput., 11 (1982), pp. 676-686.
14. J. N. LILLINGTON, Some extremal properties of convex sets, Math. Proc. Cambridge Philos. Soc., 77 (1975), pp. 515-524.
15. C. MONMA AND S. SURI, Transitions in geometric minimum spanning trees, Discrete Comput. Geom., 8 (1992), pp. 265-293.
16. C. H. PAPADIMITRIOU AND U. V. VAZIRANI, On two geometric problems related to the traveling salesman problem, J. Algorithms, 5 (1984), pp. 231-246.
17. 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, in Proc. 25th Annual ACM Symposium on the Theory of Computing, Association for Computing Machinery, New York, 1993, pp. 438-447.
18. G. ROBINS AND J. S. SALOWE, On the maximum degree of minimum spanning trees, in Proc. 10th Annual ACM Symposium on Computational Geometry, Association for Computing Machinery, New York, 1994, pp. 250-258; Discrete Comput. Geom., 14 (1995), pp. 151-166.
19. G. ROBINS AND J. S. SALOWE, On the maximum degree of minimum spanning trees, in Proc. 10th Annual ACM Symposium on Computational Geometry, Association for Computing Machinery, New York, 1994, pp. 250-258; Discrete Comput. Geom., 14 (1995), pp. 151-166.
20. J. S. SALOWE, Euclidean spanner graphs with degree four, in Proc. 8th Annual ACM Symposium on Computational Geometry, Association for Computing Machinery, New York, 1992, pp. 186-191; Discrete Appl. Math., 54 (1994), pp. 55-66.
21. J. S. SALOWE, Euclidean spanner graphs with degree four, in Proc. 8th Annual ACM Symposium on Computational Geometry, Association for Computing Machinery, New York, 1992, pp. 186-191; Discrete Appl. Math., 54 (1994), pp. 55-66.