Abstract
We present efficient algorithms for two problems of facility location. In both problems we want to determine the location of a single facility with respect to n given sites. In the first we seek a location that maximizes a weighted distance function between the facility and the sites, and in the second we find a location that minimizes the sum (or sum of the squares) of the distances of k of the sites from the facility.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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
Aurenhammer F., Edelsbrunner H.: An optimal algorithm for for constructing the weighted Voronoi diagram in the plane. Pattern Recognition 17(2) (1984) 251–257
Bajaj C.: Geometric optimization and computational complexity. Ph.D. thesis. Tech. Report TR 84-629. Cornell University (1984)
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)
Chazelle B.: Filtering search: A new approach to query-answering. SIAM J. Comput. 15 (1986) 703–724
Chazelle B.: A functional approach to data structures and its use in multidimensional searching. SIAM J. Comput. 17 (1988) 427–462
Chazelle B., Edelsbrunner H., Guibas L., Sharir M.: Algorithms for bichromatic line segment problems and polyhedral terrains. Algorithmica 11 (1994) 116–132
Elgindy H., Keil M.: Efficient algorithms for the capacitated 1-median problem, ORSA J. Comput 4 (1982) 418–424
Follert F.: Lageoptimierung nach dem Maximin-Kriterium, Diploma Thesis, Univ. d. Saarlandes., Saarbrucken (1984)
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
Megiddo N.: Applying parallel computation algorithms in the design of serial algorithms. Journal of ACM. 30 (1983) 852–865
Megiddo N., Tamir A.: New results on the complexity of p-center problems. SIAM J. Comput. bf 12(4)(1984) 751–758
Mehlhorn K.: Data Structures and Algorithms 3: Multi-dimensional Searching and Computational Geometry. Springer-Verlag (1984)
Preparata F.: New parallel-sorting schemes. IEEE Trans. Comput. C-27 (1978) 669–673
Willard D. E., Lueker G. S.: Adding range restriction capability to dynamic data structures. in J. ACM 32 (1985) 597–617
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bespamyatnikh, S., Kedem, K., Segal, M. (1999). Optimal Facility Location under Various Distance Functions. In: Dehne, F., Sack, JR., Gupta, A., Tamassia, R. (eds) Algorithms and Data Structures. WADS 1999. Lecture Notes in Computer Science, vol 1663. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48447-7_32
Download citation
DOI: https://doi.org/10.1007/3-540-48447-7_32
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66279-2
Online ISBN: 978-3-540-48447-9
eBook Packages: Springer Book Archive