Optimal facility location under various distance functions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1663, Issue , 1999, Pages 318-329

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

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

^b BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^c Department of Obstetrics Gynecology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES;

DISTANCE FUNCTIONS; FACILITY LOCATIONS; OPTIMAL FACILITY LOCATION; SINGLE FACILITIES; WEIGHTED DISTANCE;

LOCATION;

EID: 84948975385     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48447-7_32     Document Type: Conference Paper

References (15)

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. Elgindy H., Keil M.: Efficient algorithms for the capacitated 1-median problem, ORSA J. Comput 4 (1982) 418-424
9. Follert F.: Lageoptimierung nach dem Maximin-Kriterium, Diploma Thesis, Univ. d. Saarlandes. Saarbrucken (1984)
10. 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
11. Megiddo N.: Applying parallel computation algorithms in the design of serial algorithms. Journal of ACM. 30 (1983) 852-865
12. Megiddo N., Tamir A.: New results on the complexity of p-center problems. SIAM J. Comput. bf 12 (4)(1984) 751-758
13. Mehlhom K.: Data Structures and Algorithms 3: Multi-dimensional Searching and Computational Geometry. Springer-Verlag (1984)
14. Preparata F.: New parallel-sorting schemes. IEEE Trans. Comput. C-27 (1978) 669-673
15. Willard D.E., Lueker G.S.: Adding range restriction capability to dynamic data structures, in J. ACM 32 (1985) 597-617