Obnoxious facility location: Complete service with minimal harm

Research output: Contribution to journalArticlepeer-review

15 Scopus citations


We present efficient algorithms for several instances of the following facility location problem. Place k obnoxious facilities, with respect to n given demand sites and m given regions, where the goal is to maximize the minimal distance between a demand site and a facility, under the constraint that each of the regions must contain at least one facility. We also present an efficient solution to the following planar problem that arises as a subproblem. Given n transmitters, each of range r, construct a compact data structure that supports coverage queries, i.e., determine whether a query polygonal/rectangular region is fully covered by the transmitters.

Original languageEnglish
Pages (from-to)581-592
Number of pages12
JournalInternational Journal of Computational Geometry and Applications
Issue number6
StatePublished - 1 Jan 2000


  • Coverage queries
  • Facility location optimization
  • Piercing set

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Geometry and Topology
  • Computational Theory and Mathematics
  • Computational Mathematics
  • Applied Mathematics


Dive into the research topics of 'Obnoxious facility location: Complete service with minimal harm'. Together they form a unique fingerprint.

Cite this