Fast approximations for sums of distances, clustering and the Fermat-Weber problem

Computational Geometry: Theory and Applications

Volumn 24, Issue 3, 2003, Pages 135-146

  Bose, Prosenjit ^a   Maheshwari, Anil ^a   Morin, Pat ^a  

^a CARLETON UNIVERSITY   (Canada)

Author keywords

Clustering; Data structure; Facility location; Fermat Weber center; Quadtree; Randomization; Range tree

Indexed keywords

EID: 84867943034     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-7721(02)00102-5     Document Type: Article

References (21)

1. C. Bajaj The algebraic degree of geometric optimization problems Discrete Comput. Geom. 3 1988 177 191
2. S. Bespamyatnikh, K. Kedem, and M. Segal Optimal facility location under various distance functions Proceedings of the 6th International Workshop on Algorithms and Data Structures (WADS'99) 1999 318 329
3. J. Brimberg, and G.O. Wesolowsky The rectilinear distance minsum problem with minimum distance constraints Location Sci. 3 3 1995 203 215
4. R. Chandrasekaran, and A. Tamir Algebraic optimization: The Fermat-Weber location problem Math. Programming 46 2 1990 219 224
5. R.L. Church, and R.S. Garfinkel Locating an obnoxious facility on a network Transportation Sci. 12 2 1978 107 119
6. H. Elgindy, and M. Keil Efficient algorithms for the capacitated 1-median problem ORSA J. Comput. 4 1982 418 424
7. Estivill-Castro, and Houle Robust distance-based clustering with applications to spatial data mining Algorithmica 30 2 2001 216 242
8. R.L. Francis Facility Layout and Location: An Analytical Approach 1974 Prentice-Hall Englewood Cliffs, NJ
9. P. Indyk Sublinear time algorithms for metric space problems Proceedings of the 31st ACM Symposium on Theory of Computing (STOC'99) 1999 428 434
10. M.J. Katz, K. Kedem, and M. Segal Improved algorithms for placing undesirable facilities Abstracts for the Eleventh Canadian Conference on Computational Geometry (CCCG'99) 1999 65 67 http://www.cs.ubc.ca/conferences/ CCCG/elec-proc/elecproc.html
11. L. Kaufman, and P.J. Rousseeuw Finding Groups in Data: An Introduction to Cluster Analysis 1990 Wiley New York
12. D.E. Knuth Two notes on notation Amer. Math. Monthly 99 1992 403 422
13. Z.A. Melzak Companion to Concrete Mathematics; Mathematical Techniques and Various Applications 1973 Wiley New York
14. R.T. Ng, and J. Han Efficient and effective clustering methods for spatial data mining Proceedings of the 20th Conference on Very Large Databases (VLDB) 1994 144 155
15. C.H. Papadimitriou, and M. Yannakakis Combinatorial Optimization: Algorithms and Complexity 1982 Prentice-Hall Englewood Cliffs, NJ
16. F.P. Preparata, and M.I. Shamos Computational Geometry 1985 Springer-Verlag Berlin
17. J. Ruppert, and R. Seidel Approximating the d-dimensional complete Euclidean graph Proceedings of the Third Canadian Conference on Computational Geometry (CCCG'91) 1991 207 210
18. H. Samet The Design and Analysis of Spatial Data Structures 1990 Addison-Wesley Reading, MA
19. C. Watson-Gandy A note on the centre of gravity in depot location Management Sci. 18B 1972 478 481
20. R. Webster, and M.A. Oliver Statistical Methods in Land and Resource Survey 1990 Oxford University Press Oxford
21. A.C.-C. Yao On constructing minimum spanning trees in k-dimensional spaces and related problems SIAM J. Comput. 11 4 1982 721 736