18,990 research outputs found
A Constant-Factor Approximation for Multi-Covering with Disks
We consider variants of the following multi-covering problem with disks. We
are given two point sets (servers) and (clients) in the plane, a
coverage function , and a constant . Centered at each server is a single disk whose radius we are free to
set. The requirement is that each client be covered by at least
of the server disks. The objective function we wish to minimize is
the sum of the -th powers of the disk radii. We present a polynomial
time algorithm for this problem achieving an approximation
Constant-Factor Approximation for TSP with Disks
We revisit the traveling salesman problem with neighborhoods (TSPN) and
present the first constant-ratio approximation for disks in the plane: Given a
set of disks in the plane, a TSP tour whose length is at most times
the optimal can be computed in time that is polynomial in . Our result is
the first constant-ratio approximation for a class of planar convex bodies of
arbitrary size and arbitrary intersections. In order to achieve a
-approximation, we reduce the traveling salesman problem with disks, up
to constant factors, to a minimum weight hitting set problem in a geometric
hypergraph. The connection between TSPN and hitting sets in geometric
hypergraphs, established here, is likely to have future applications.Comment: 14 pages, 3 figure
- …