A Polynomial-Time Approximation Scheme for the Geometric Unique Coverage Problem on Unit Squares
From MaRDI portal
Publication:2904540
DOI10.1007/978-3-642-31155-0_3zbMath1357.68293OpenAlexW130989389MaRDI QIDQ2904540
Takehiro Ito, Takeaki Uno, Yushi Uno, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Shin-ichi Nakano
Publication date: 14 August 2012
Published in: Algorithm Theory – SWAT 2012 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-31155-0_3
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Approximation algorithms (68W25)
Related Items
A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares ⋮ Discrete unit square cover problem ⋮ On nonlinear multi-covering problems ⋮ A 4.31-approximation for the geometric unique coverage problem on unit disks ⋮ Local search strikes again: PTAS for variants of geometric covering and packing ⋮ Geometric red-blue set cover for unit squares and related problems
