Bounded-diameter minimum spanning trees and related problems

Proceedings of the Annual Symposium on Computational Geometry

Volumn Part F130124, Issue , 1989, Pages 276-282

  Ho, Jan Ming ^a   Lee, D T ^a   Wong, C K ^b   Chang, Chia Hsiang ^c  

^a NORTHWESTERN UNIVERSITY   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

^c NEW YORK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GEOMETRY; GEOMETRY;

BOUNDED DIAMETER; EUCLIDEAN PLANES; MAXIMUM DISTANCE; MINIMUM DIAMETER SPANNING TREE; MINIMUM DIAMETERS; MINIMUM SPANNING TREES; STEINER TREE PROBLEM; WEIGHTED UNDIRECTED GRAPH;

TREES (MATHEMATICS);

EID: 11544271414     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/73833.73862     Document Type: Conference Paper

References (13)

1. W. G. Brown. Reviews in Graph Theory. American Mathematical Society, Providence, RI, 1980
2. D. Cheriton and R.E. Tarjan. Finding minimum spanning trees. SIAM J. Comput., 5(4):724-742, December 1976
3. M. E. Dyer. Linear time algorithms for two-And three-variable linear programs. SIAM J. Cornputing, 13:31-45, February 1984
4. H. Edelsbrunner, L. J. Guibas, and J. Stolfi. Optimal point location in a monotone subdivision, SIAM J. Cornput., 15(2):317-340, May 1985
5. M. R. Garey and D. S. Johnson. Computers and intractability: A guide to the theory of NPcompleteness Freeman, San Francisco, 1979
6. M. R. Garey and D. S. Johnson. Unpublished results. see [5, p.2061 for details
7. I. G. Gowda, D. G. Kirkpatrick, D. T. Lee, and A. Naamad. Dynamic voronoi diagrams. IEEE Transaction on Information Theory, IT-29(5), September 1983
8. D. G. Kirkpatrick. Optimal search in planar subdivisions. SIAM J. Comput., 12(1):28-35, February 1983
9. D. T. Lee. Farthest neighbor Voronoi diagrams and applications. Technical Report Tech. Rep #80-11-FC-04, Dept. Elec. Eng./Comput. Sci., Northwestern Univ., Evanston, IL, November 1980
10. N. Megiddo. Linear-Time algorithms for linear programming in R3 and related problems. SIAM J. Computing, 12(4):759-776, November 1983
11. F. P. Preparata. A new approach to planar point location. SIAM J. Comput., 10:473-482, August 1981
12. R. C. Prim. Shortest connecting networks and some generalizations. BSTJ 96, 1389-1401, 1957
13. M. I. Shamos and D. Hoey. Closest-point problems In Sixteenth Annual IEEE Symposium on Foundations of Computer Science, pages 151-162, October 1975