Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Optimal Facility Location under Various Distance Functions

  • Conference paper
  • First Online:
Algorithms and Data Structures (WADS 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1663))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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

    Article  MathSciNet  Google Scholar 

  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

    Article  MathSciNet  MATH  Google Scholar 

  3. Bajaj C.: Geometric optimization and computational complexity. Ph.D. thesis. Tech. Report TR 84-629. Cornell University (1984)

    Google Scholar 

  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)

    Google Scholar 

  5. Chazelle B.: Filtering search: A new approach to query-answering. SIAM J. Comput. 15 (1986) 703–724

    Article  MathSciNet  MATH  Google Scholar 

  6. Chazelle B.: A functional approach to data structures and its use in multidimensional searching. SIAM J. Comput. 17 (1988) 427–462

    Article  MathSciNet  MATH  Google Scholar 

  7. Chazelle B., Edelsbrunner H., Guibas L., Sharir M.: Algorithms for bichromatic line segment problems and polyhedral terrains. Algorithmica 11 (1994) 116–132

    Article  MathSciNet  MATH  Google Scholar 

  8. Elgindy H., Keil M.: Efficient algorithms for the capacitated 1-median problem, ORSA J. Comput 4 (1982) 418–424

    MathSciNet  Google Scholar 

  9. Follert F.: Lageoptimierung nach dem Maximin-Kriterium, Diploma Thesis, Univ. d. Saarlandes., Saarbrucken (1984)

    Google Scholar 

  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

    Google Scholar 

  11. Megiddo N.: Applying parallel computation algorithms in the design of serial algorithms. Journal of ACM. 30 (1983) 852–865

    Article  MathSciNet  MATH  Google Scholar 

  12. Megiddo N., Tamir A.: New results on the complexity of p-center problems. SIAM J. Comput. bf 12(4)(1984) 751–758

    Article  MathSciNet  Google Scholar 

  13. Mehlhorn K.: Data Structures and Algorithms 3: Multi-dimensional Searching and Computational Geometry. Springer-Verlag (1984)

    Google Scholar 

  14. Preparata F.: New parallel-sorting schemes. IEEE Trans. Comput. C-27 (1978) 669–673

    Article  MathSciNet  Google Scholar 

  15. Willard D. E., Lueker G. S.: Adding range restriction capability to dynamic data structures. in J. ACM 32 (1985) 597–617

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of British Columbia, Vancouver, B.C., Canada, V6T 1Z4

    Sergei Bespamyatnikh

  2. Ben-Gurion University of the Negev, Beer-Sheva, 84105, Israel

    Klara Kedem & Michael Segal

  3. Cornell University, Upson Hall, Cornell University, Ithaca, NY, 14853

    Klara Kedem

Authors
  1. Sergei Bespamyatnikh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Klara Kedem
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Michael Segal
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer Science, Carleton University, 1125 Colonel By Drive, Ottawa, Canada, K1S 5B6

    Frank Dehne  & Jörg-Rüdiger Sack  & 

  2. School of Computer Science, Simon Fraser University, Burnaby, BC, Canada, V5A 1S6

    Arvind Gupta

  3. Center for Geometric Computing Providence, Brown University, RI, 02912-1910, USA

    Roberto Tamassia

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation