Minimum Cost Coverage of Point Sets by Disks

We consider a class of geometric facility location problems in which the goal is to determine a set X of disks given by their centers (tj) and radii (rj) that cover a given set of demand points at the smallest possible cost. We consider cost functions of the form where is the cost of transmission to radius r. Special cases arise for (sum of radii) and (total area) ; power consumption models in wireless network design often use an exponent .l Different scenarios arise according to possible restrictions on the transmission centers tj, which may be constrained to belong to a given discrete set or to lie on a line, etc.

We obtrain several new results, including (a) exact and approximation algorithms for selecting transmission points tj on a given line in order to cover demand points (b) approximation algorithms (and an algebraic intractability result) for selecting an optimal line on which to place transmission points to cover Y; (c) a proof of NP-hardness for a discrete set of transmission points in and any fixed and (d) a polynomial-time approximatoin scheme for the problem of computing a minimum cost covering tour (MCCT), in which the total cost is a linear combination of the transmission coxt for the set of disks and the length of a tour/path that connects the centers of the disks.

By: Helmut Alt, Esther M. Arkin, Hervé Brönnimann, Jeff Erickson, Sándor Fekete, Christian Knauer, Jonathan Lenchner, Joseph S. B. Mitchell, Kim Whittlesey

Published in: RC23831 in 2005


This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.


Questions about this service can be mailed to .