A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf
.
A PTAS for a Disc Covering Problem Using Width-Bounded Separators
[chapter]
2005
Lecture Notes in Computer Science
In this paper, we study the following disc covering problem: Given a set of discs of various radii on the plane and centers on the grid points, find a subset of discs to maximize the area covered by exactly one disc. This problem originates from the application in digital halftoning, with the best known approximation factor being 5.83 (Asano et al. 2004) . We show that if their radii are between two positive constants, then there exists a polynomial time approximation scheme. Our techniques are
doi:10.1007/11533719_50
fatcat:gz3oswazrraj5ozutbqatsnfzm