Competitive location in the L1 and Linf metrics
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.
KeywordsVoronoi Diagram Demand Point Vertical Edge Left Endpoint Naive Algorithm
Unable to display preview. Download preview PDF.