Maximizing the number of obnoxious facilities to locate within a bounded region

Authors:
Shimon Abravaya;Michael Segal
Affiliations:
Department of Computer Science, Ben-Gurion University of the Negev, Beer-Sheva 84105, Israel;Department of Communication Systems Engineering, Ben-Gurion University of the Negev, Beer-Sheva 84105, Israel
Venue:
Computers and Operations Research
Year:
2010

Citing 5
Cited 1

Computational geometry: an introduction

Computational geometry: an introduction
Approximation schemes for covering and packing problems in image processing and VLSI

Journal of the ACM (JACM)
A Survey on Obnoxious Facility Location Problems

A Survey on Obnoxious Facility Location Problems
Dynamic coverage in ad-hoc sensor networks

Mobile Networks and Applications
Locating two obnoxious facilities using the weighted maximin criterion

Operations Research Letters

Survey: Covering problems in facility location: A review

Computers and Industrial Engineering

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper deals with the problem of locating a maximal cardinality set of obnoxious facilities within a bounded rectangle in the plane such that their pairwise L"~-distance as well as the L"~-distance to a set of already placed demand sites is above a given threshold. We employ techniques and methods from computational geometry to design an optimization algorithm and an efficient 12-approximation algorithm for the problem, and employ the optimization algorithm to design a PTAS based on the shifting strategy [Hochbaum DS, Maass W. Approximation schemes for covering and packing problems in image processing and VLSI. Journal of the ACM 1985;32:130-6]. As a byproduct we improve the algorithm for placing obnoxious facilities given by Katz et al. [Improved algorithms for placing undesirable facilities. Computers & Operations Research 2002;29:1859-72.].