Book ChapterDOI
Competitive location in the L 1 and L INF metrics
Ramesh Govindan,Pandu Rangan +1 more
- pp 70-83
TLDR
This paper solves 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 in O(nlogn) time for the distance metrics L1 and Linf.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.read more
References
More filters
Journal ArticleDOI
Optimal Search in Planar Subdivisions
TL;DR: This work presents a practical algorithm for subdivision search that achieves the same (optimal) worst case complexity bounds as the significantly more complex algorithm of Lipton and Tarjan, namely $O(\log n)$ search time with $O(n)$ storage.
Journal ArticleDOI
Two-Dimensional Voronoi Diagrams in the Lp-Metric
TL;DR: Many proximity problems revolving a set of points, such as finding the nearest neighbor of a given point, finding the minimum spamung tree, findmg the smallest circle enclosing the point set, etc., can be solved very efficiently via the Voronoi diagram.
Journal ArticleDOI
Competitive location strategies for two facilities
TL;DR: In this paper, the problem of locating a facility when competition from another facility is taken into consideration is addressed, and two problems are addressed here: 1) the location of a new facility that will attract the most buying power from an existing facility and 2) the best location of competing facility to be set up in the future.