Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Graph-Theoretic Concepts in Computer Science

WG 1987: Graph-Theoretic Concepts in Computer Science pp 70–83Cite as

Competitive location in the L1 and Linf metrics

  • Graphs, Geometry And Data Structures
  • Conference paper
  • First Online:

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

Abstract

In this paper we consider the problem of locating a new facility which is at least a given distance away from each of m existing facilities and which attracts the maximum number of the n existing demand points (m < n). We solve this problem in O(nlogn) time for the distance metrics L1 and Linf.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

6. References

  1. Drezner Z. Competitive location strategies for two facilities. Regional Sc. and Urban Economics, 12(1982), pp485–493.

    Article  Google Scholar 

  2. Kirkpatrick D.G. Optimal Search in a planar subdivision. SIAM J1. of Comptg., 12, 1(1983), pp28–35.

    Article  Google Scholar 

  3. Lee D.T. Two-dimensional Voronoi diagram in the L(p) metric. Jl. of Assoc. Comp. Mach., 27(1980), pp604–618.

    Google Scholar 

  4. Lee D.T. Maximum Clique problem of rectangle graphs. Advances in Comptg. Res., Vol 1, JAI Press, 1983, pp91–107.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Indian Institute of Technology, 600 036, Madras, India

    Ramesh Govindan & Pandu Rangan

Authors
  1. Ramesh Govindan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pandu Rangan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Herbert Göttler Hana-Jürgen Schneider

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Govindan, R., Rangan, P. (1988). Competitive location in the L1 and Linf metrics. In: Göttler, H., Schneider, HJ. (eds) Graph-Theoretic Concepts in Computer Science. WG 1987. Lecture Notes in Computer Science, vol 314. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-19422-3_6

Download citation

  • DOI: https://doi.org/10.1007/3-540-19422-3_6

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-19422-4

  • Online ISBN: 978-3-540-39264-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation