scientific article; zbMATH DE number 5764844

MaRDI QIDQ3579437zbMATH OpenFDO

Authors Thomas Erlebach, Erik Jan van Leeuwen

Publication date 6 August 2010

Mathematics Subject Classification ID

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

Cited in

(20)

• Minimum ply covering of points with disks and squares
• A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares
• scientific article; zbMATH DE number 7378687 (Why is no real title available?)
• The Budgeted Unique Coverage Problem and Color-Coding
• Packing and covering with non-piercing regions
• A 4.31-approximation for the geometric unique coverage problem on unit disks
• On Covering Segments with Unit Intervals
• The parameterized complexity of unique coverage and its variants
• Shifting strategy for geometric graphs without geometry
• Minimum ply covering of points with unit squares
• Local search strikes again: PTAS for variants of geometric covering and packing
• Minimum membership covering and hitting
• Minimum clique partition in unit disk graphs
• Unique coverage with rectangular regions
• Quasi-Polynomial Time Approximation Scheme for Weighted Geometric Set Cover on Pseudodisks and Halfspaces
• Approximation algorithms for minimum ply covering of points with unit squares and unit disks
• On nonlinear multi-covering problems
• Maximum independent and disjoint coverage
• Geometric red-blue set cover for unit squares and related problems
• Improved algorithms for minimum-membership geometric set cover

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3579437)