TY - GEN
T1 - Approximation schemes for covering and packing
AU - Aschner, Rom
AU - Katz, Matthew J.
AU - Morgenstern, Gila
AU - Yuditsky, Yelena
N1 - Funding Information:
Work by R. Aschner was partially supported by the Lynn and William Frankel Center for Computer Sciences. Work by R. Aschner and M.J. Katz was partially supported by the Israel Ministry of Industry, Trade and Labor (consortium CORNET). Work by M.J. Katz was partially supported by grant 1045/10 from the Israel Science Foundation, and by grant 2010074 from the United States – Israel Binational Science Foundation. Work by G. Morgenstern was partially supported by the Caesarea Rothschild Institute (CRI).
PY - 2013/2/4
Y1 - 2013/2/4
N2 - The local search framework for obtaining PTASs for NP-hard geometric optimization problems was introduced, independently, by Chan and Har-Peled [6] and Mustafa and Ray [17]. In this paper, we generalize the framework by extending its analysis to additional families of graphs, beyond the family of planar graphs. We then present several applications of the generalized framework, some of which are very different from those presented to date (using the original framework). These applications include PTASs for finding a maximum l-shallow set of a set of fat objects, for finding a maximum triangle matching in an l-shallow unit disk graph, and for vertex-guarding a (not-necessarily- simple) polygon under an appropriate shallowness assumption. We also present a PTAS (using the original framework) for the important problem where one has to find a minimum-cardinality subset of a given set of disks (of varying radii) that covers a given set of points, and apply it to a class cover problem (studied in [3]) to obtain an improved solution.
AB - The local search framework for obtaining PTASs for NP-hard geometric optimization problems was introduced, independently, by Chan and Har-Peled [6] and Mustafa and Ray [17]. In this paper, we generalize the framework by extending its analysis to additional families of graphs, beyond the family of planar graphs. We then present several applications of the generalized framework, some of which are very different from those presented to date (using the original framework). These applications include PTASs for finding a maximum l-shallow set of a set of fat objects, for finding a maximum triangle matching in an l-shallow unit disk graph, and for vertex-guarding a (not-necessarily- simple) polygon under an appropriate shallowness assumption. We also present a PTAS (using the original framework) for the important problem where one has to find a minimum-cardinality subset of a given set of disks (of varying radii) that covers a given set of points, and apply it to a class cover problem (studied in [3]) to obtain an improved solution.
UR - https://www.scopus.com/pages/publications/84873819762
U2 - 10.1007/978-3-642-36065-7_10
DO - 10.1007/978-3-642-36065-7_10
M3 - Conference contribution
AN - SCOPUS:84873819762
SN - 9783642360640
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 89
EP - 100
BT - WALCOM
T2 - 7th International Workshop on Algorithms and Computation, WALCOM 2013
Y2 - 14 February 2013 through 16 February 2013
ER -