scientific article; zbMATH DE number 5764844
From MaRDI portal
Publication:3579437
zbMATH Open1192.68743MaRDI QIDQ3579437FDOQ3579437
Authors: Thomas Erlebach, Erik Jan van Leeuwen 
Publication date: 6 August 2010
Title of this publication is not available (Why is that?)
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
- Title not available (Why is that?)
- The Budgeted Unique Coverage Problem and Color-Coding
- Packing and covering with non-piercing regions
- On Covering Segments with Unit Intervals
- A 4.31-approximation for the geometric unique coverage problem on unit disks
- 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
- Approximation algorithms for minimum ply covering of points with unit squares and unit disks
- Quasi-Polynomial Time Approximation Scheme for Weighted Geometric Set Cover on Pseudodisks and Halfspaces
- On nonlinear multi-covering problems
- Maximum independent and disjoint coverage
- Improved algorithms for minimum-membership geometric set cover
- Geometric red-blue set cover for unit squares and related problems
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)
