Packing and Covering with Non-Piercing Regions
From MaRDI portal
Publication:4606318
DOI10.4230/LIPIcs.ESA.2016.47zbMath1397.68225OpenAlexW2544343122MaRDI QIDQ4606318
Aniket Basu Roy, Saurabh Ray, Rajiv Raman, Sathish Govindarajan
Publication date: 2 March 2018
Full work available at URL: https://dx.doi.org/10.4230/LIPIcs.ESA.2016.47
Combinatorial optimization (90C27) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Approximation algorithms (68W25)
Related Items (16)
On pseudo-disk hypergraphs ⋮ On dominating set of some subclasses of string graphs ⋮ Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs ⋮ Existence of planar support for geometric hypergraphs using elementary techniques ⋮ Capacitated covering problems in geometric spaces ⋮ Unnamed Item ⋮ Approximating Dominating Set on Intersection Graphs of Rectangles and L-frames ⋮ Limits of local search: quality and efficiency ⋮ Unnamed Item ⋮ On Geometric Set Cover for Orthants ⋮ Unnamed Item ⋮ Local search strikes again: PTAS for variants of geometric covering and packing ⋮ On Partial Covering For Geometric Set Systems ⋮ Approximating dominating set on intersection graphs of rectangles and \(\mathsf{L}\)-frames ⋮ Capacitated Covering Problems in Geometric Spaces ⋮ A tight analysis of geometric local search
This page was built for publication: Packing and Covering with Non-Piercing Regions
