Header menu link for other important links
X
Competitive location in the L1 and Linf metrics
Ramesh Govindan, Pandu Rangan
Published in Springer Verlag
1988
Volume: 314 LNCS
   
Pages: 70 - 83
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. © 1988, Springer-Verlag.
About the journal
JournalData powered by TypesetLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherData powered by TypesetSpringer Verlag
ISSN03029743
Open AccessNo
Concepts (7)
  •  related image
    Artificial intelligence
  •  related image
    Computer science
  •  related image
    Computers
  •  related image
    Competitive location
  •  related image
    DISTANCE METRICS
  •  related image
    NEW FACILITIES
  •  related image
    Graph theory