Optimal facility location under various distance functions

International Journal of Computational Geometry and Applications

Volumn 10, Issue 5, 2000, Pages 523-534

  Bespamyatnikh, Sergei ^a   Kedem, Klara ^b   Segal, Michael ^a   Tamir, Arie ^c  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

^b BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^c TEL AVIV UNIVERSITY   (Israel)

Author keywords

Facility location; Optimization; Orthogonal range search; Parametric search

Indexed keywords

EID: 0034356513     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218195900000292     Document Type: Article

References (18)

1. Attalah M., Cole R., Goodrich M.: Cascading divide and conquer: a technique for designing parallel algorithms. SIAM Journal on Computing, 18 (3) (1989) 499-532
2. Aurenhammer F., Edelsbrunner H.: An optimal algorithm for for constructing the weighted Voronoi diagram in the plane. Pattern Recognition 17 (2) (1984) 251-257
3. Bajaj C.: Geometric optimization and computational complexity. Ph.D. thesis. Tech. Report TR-84-629. Cornell University (1984)
4. Bhattacharya B., ElGindy H.: An efficient algorithm for an intersection problem and an application. Tech. Report 86-25. Dept. of Comp. and Inform. Sci. University of Pennsylvania (1986)
5. Chazelle B.: Filtering search: A new approach to query-answering. SIAM J. Comput. 15 (1986) 703-724
6. Chazelle B.: A functional approach to data structures and its use in multidimensional searching. SIAM J. Comput. 17 (1988) 427-462
7. Chazelle B., Edelsbrunner H., Guibas L., Sharir M.: Algorithms for bichromatic line segment problems and polyhedral terrains. Algorithmica 11 (1994) 116-132
8. Cole R. : Slowing down sorting networks to obtain faster sorting algorithms. J. ACM 34 (1987) 200-208
9. ElGindy H., Keil M.: Efficient algorithms for the capacitated 1-median problem, ORSA J. Comput 4 (1992) 418-425
10. Follert F.: Lageoptimierung nach dem Maximin-Kriterium, Diploma Thesis, Univ. d. Saarlandes. Saarbrucken (1994)
11. Follert F., Schömer E., Sellen J.: Subquadratic algorithms for the weighted maximin facility location problem. in Proc. 7th Canad. Conf. Comput. Geom. (1995) 1-6
12. Konforty Y., Tamir A.: The single facility location problem with minimum distance constraints. Location Science 5 (1997) 147-163
13. Megiddo N.: Applying parallel computation algorithms in the design of serial algorithms. Journal of ACM. 30 (1983) 852-865
14. Megiddo N., Tamir A.: New results on the complexity of p-center problems. SIAM J. Comput. 12 (4)(1984) 751-758
15. Mehlhorn K.: Data Structures and Algorithms 3: Multi-dimensional Searching and Computational Geometry. Springer-Verlag (1984)
16. Preparata F.: New parallel-sorting schemes. IEEE Trans. Comput. C-27 (1978) 669-673
17. Tamir A.: Improved complexity bounds for center location problems on networks by using dynamic data structures. SIAM J. Disc. Math. 1 (1988) 377-396
18. Willard D.E., Lueker G.S.: Adding range restriction capability to dynamic data structures. in J. ACM 32 (1985) 597-617