New techniques for some dynamic closest-point and farthest-point problems

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 1990, Pages 84-90

  Supowit, Kenneth J ^a  

^a OHIO STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BENTLEY; EFFICIENT IMPLEMENTATION; GREEDY HEURISTICS; MAXIMUM WEIGHT MATCHING; POINT PROBLEM;

ALGORITHMS;

EID: 0001936327     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. D. Avis, "Worst-case bounds for the Euclidean matching problem", Comput. Math. Apply Vol. 7(1981), pp. 251-257.
2. D. Avis, "A survey of heuristics for the weighted matching problem", Networks, Vol. 13(1983), pp. 475-493.
3. D. Avis, B. Davis and J. M. Steele, "Probabilistic analysis of a greedy heuristic for Euclidean matching", Probability in the Engineering and Informational Sciences, Vol. 2(1988), pp. 143-156.
4. J. L. Bentley, "Divide and conquer algorithms for closest point problems in multidimensional space", Ph. D. dissertation, Univ. of North Carolina, Chapel Hill, NC, 1976.
5. J. L. Bentley, "Multidimensional Divide-and-Conquer", Comm. of the ACM, Vol. 23, No. 4(April 1980), pp. 214-229.
6. J. L. Bentley and J. B. Saxe, "Decomposable searching problems 1: Static to dynamic transformations", J. Algorithms, Vol. 1(1980), pp. 301-358.
7. M. H. Overmars and J. van Leeuwen, "Maintenance of configurations in the plane", J. Comput. and Syst. Set, Vol. 23(1981), pp. 166-204.
8. C. H. Papadimitriou, "The probabilistic analysis of matching heuristics", Proc. 15th Allerton Conference on Communication, Control and Computing (1977), pp. 368-378.
9. F. P. Preparata and M. I. Shamos, Computational Geometry: An Introduction, Springer-Verlag, 1985.
10. E. M. Reingold and B.. E. Tarjan, "On a greedy heuristic for complete matching", SIAM J. Comput., Vol. 10 (1981) pp. 676-681.
11. D. J. Eosenkrantz, R. E. Stearns and P. M. Lewis, "An analysis of several heuristics for the traveling salesman problem", SIAM J. Comput., Vol. 6(1977), pp. 563-581.
12. M. I. Shamos, "Geometric complexity", Proc. 7th ACM Symp. Theory of Comput. (1975), pp. 224-233.
13. T. L. Snyder and J. M. Steele, "Worst case greedy matchings in the unit d-cube", submitted for publication.
14. P. Vaidya, "Geometry help in matching", Proc. 20th ACM Symp. on Theory of Comput. (1988), pp. 422-425.
15. P. Vaidya, personal communication.
16. A. C. Yao, "On constructing minimum spanning trees in k-dimensional space and related problems", SIAM J. Comput, Vol. 11, No. 4(1982), pp. 721-736.