Single facility collection depots location problem in the plane

Computational Geometry: Theory and Applications

Volumn 42, Issue 5, 2009, Pages 403-418

  Benkoczi, Robert ^a   Bhattacharya, Binay K ^b   Das, Sandip ^c   Sember, Jeff ^d  

^a UNIVERSITY OF LETHBRIDGE   (Canada)

^b SIMON FRASER UNIVERSITY   (Canada)

^c INDIAN STATISTICAL INSTITUTE   (India)

^d UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

Approximation algorithms; Coresets; Facility location; Minmax; Minsum; Voronoi diagram

Indexed keywords

EID: 84867955364     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comgeo.2008.04.004     Document Type: Conference Paper

References (27)

1. P.K. Agarwal, B. Aronov, M. Sharir, and S. Suri Selecting distances in the plane SCG '90: Proceedings of the Sixth Annual Symposium on Computational Geometry New York, NY, USA 1990 ACM 321 331
2. P.K. Agarwal, S. Har-Peled, and K.R. Varadarajan Approximating extent measures of points J. ACM 51 4 2004 606 635
3. P.K. Agarwal, S. Har-Peled, and K.R. Varadarajan Geometric approximation via coresets Combin. Comput. Geom. 52 2005 1 30
4. C. Bajaj The algebraic degree of geometric optimization problems Discrete Comput. Geom. 3 2 1988 177 191
5. R. Benkoczi, B. Bhattacharya, and A. Tamir Collection depots facility location problems in trees Networks 53 1 2009 50 62
6. O. Berman, Z. Drezner, and G.O. Wesolowsky The collection depots location problem on networks Naval Research Logistics 49 2002 15 24
7. O. Berman, and R. Huang Minisum collection depots location problem with multiple facilities on a network J. Oper. Res. Soc. 55 2004 769 779
8. P. Bose, A. Maheshwari, and P. Morin Fast approximations for sums of distances, clustering and the Fermat-Weber problem Comput. Geom. Theory Appl. 24 3 2003 135 146
9. R. Chandrasekaran, and A. Tamir Algebraic optimization: the Fermat-Weber location problem Math. Program. 46 2 1990 219 224
10. T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein Introduction to Algorithms 2001 MIT Press Cambridge, MA
11. Z. Drezner, and G.O. Wesolowsky On the collection depots location problem European J. Oper. Res. 130 2001 510 518
12. H. Edelsbrunner, L.J. Guibas, J. Pach, R. Pollack, R. Seidel, and M. Sharir Arrangements of curves in the plane - topology, combinatorics, and algorithms ICALP '88: Proceedings of the 15th International Colloquium on Automata, Languages and Programming London, UK 1988 Springer-Verlag 214 229
13. D. Feldman, M. Monemizadeh, and C. Sohler A ptas for k-means clustering based on weak coresets SCG '07: Proceedings of the Twenty-Third Annual Symposium on Computational Geometry New York, NY, USA 2007 ACM 11 18
14. S. Fortune A sweepline algorithm for Voronoi diagrams Algorithmica 2 1987 153 174
15. L.J. Guibas, and J. Stolfi Ruler, compass and computer: the design and analysis of geometric algorithms R.A. Earnshaw, Theoretical Foundations of Computer Graphics and CAD NATO ASI Series F vol. 40 1988 Springer-Verlag 111 165
16. S. Har-Peled, and A. Kushal Smaller coresets for k-median and k-means clustering SCG '05: Proceedings of the Twenty-First Annual Symposium on Computational Geometry New York, NY, USA 2005 ACM 126 134
17. S. Har-Peled, and S. Mazumdar On coresets for k-means and k-median clustering STOC '04: Proceedings of the Thirty-Sixth Annual ACM Symposium on Theory of Computing New York, NY, USA 2004 ACM 291 300
18. M.I. Karavelas, M. Yvinec, Dynamic additively weighted Voronoi diagrams in 2D, in: ESA: Annual European Symposium on Algorithms, 2002
19. K. Klamroth Planar weber location problems with line barriers Optimization 49 2001 517 527
20. N. Megiddo Applying parallel computation algorithms in the design of serial algorithms J. ACM 30 4 October 1983 852 865
21. J. O'Rourke Computational Geometry in C 1998 Cambridge University Press New York, NY, USA
22. F. Plastria, How bad can the centroid be? in: European Conference on Operational Research, 2007
23. M. Sharir, and P.K. Agarwal Davenport-Schinzel Sequences and their Geometric Applications 1995 Cambridge University Press
24. A. Tamir, N. Halman, Private communication, 2005
25. A. Tamir, and N. Halman One-way and round-trip center location problems Discrete Optim. 2 2005 168 184
26. E. Weiszfeld Sur le point pour lequel la somme des distances de n points donnes est minimum Tohoku Math. J. 43 1936 355 386
27. G.O. Wesolowsky The Weber problem: History and perspective Location Sci. 1 1993 5 23