Competitive location in the L1 and Linf metrics

  • Ramesh Govindan
  • Pandu Rangan
Graphs, Geometry And Data Structures
Part of the Lecture Notes in Computer Science book series (LNCS, volume 314)


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.


Voronoi Diagram Demand Point Vertical Edge Left Endpoint Naive Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

6. References

  1. 1.
    Drezner Z. Competitive location strategies for two facilities. Regional Sc. and Urban Economics, 12(1982), pp485–493.CrossRefGoogle Scholar
  2. 2.
    Kirkpatrick D.G. Optimal Search in a planar subdivision. SIAM J1. of Comptg., 12, 1(1983), pp28–35.CrossRefGoogle Scholar
  3. 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. 4.
    Lee D.T. Maximum Clique problem of rectangle graphs. Advances in Comptg. Res., Vol 1, JAI Press, 1983, pp91–107.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • Ramesh Govindan
    • 1
  • Pandu Rangan
    • 1
  1. 1.Department of Computer Science and EngineeringIndian Institute of TechnologyMadrasIndia

Personalised recommendations