scientific article

zbMath1192.68743MaRDI QIDQ3579437

Erik Jan van Leeuwen, Erlebach, Thomas

Publication date: 6 August 2010

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Related Items

Minimum ply covering of points with disks and squares, Quasi-Polynomial Time Approximation Scheme for Weighted Geometric Set Cover on Pseudodisks and Halfspaces, The parameterized complexity of unique coverage and its variants, Minimum ply covering of points with unit squares, A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares, Unnamed Item, Shifting strategy for geometric graphs without geometry, Minimum clique partition in unit disk graphs, Unique Coverage with Rectangular Regions, On nonlinear multi-covering problems, Packing and covering with non-piercing regions, A 4.31-approximation for the geometric unique coverage problem on unit disks, Minimum membership covering and hitting, Maximum independent and disjoint coverage, Local search strikes again: PTAS for variants of geometric covering and packing, The Budgeted Unique Coverage Problem and Color-Coding, Geometric red-blue set cover for unit squares and related problems, On Covering Segments with Unit Intervals