Article thumbnail

Constrained Facility Location

By Ferran Hurtado, Vera Sacristán and Godfried Toussaint


In this paper we consider constrained versions of the minimax facility location problem. We provide an O(n +m) time algorithm for the problem of constructing the minimum enclosing circle of a set of n points with center constrained to satisfy m linear constraints. As a corollary, we obtain a linear time algorithm for the problem when the center is constrained to lie in an m-vertex convex polygon, which improves the best known solution of O((n +m) log(n +m)) time. We also consider some constrained versions of the maximin problem, namely an obnoxious facility location problem in which we are given a set of n linear constraints, each representing a halfplane where some population may live, and the goal is to locate a point such that the minimum distance to the inhabited region is maximized. We provide optimal \Theta(n) time algorithms for this problem in the plane, as well as on the sphere. 1 Departament de Matem`atica Aplicada II, Universitat Polit`ecnica de Catalunya, Pau Gargallo 5, ..

Year: 2000
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.