On Covering Problems of Rado
From MaRDI portal
Publication:3512467
DOI10.1007/978-3-540-69903-3_27zbMath1155.68545MaRDI QIDQ3512467
Adrian Dumitrescu, Sergey Bereg, Ming-Hui Jiang
Publication date: 15 July 2008
Published in: Algorithm Theory – SWAT 2008 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-69903-3_27
52B55: Computational aspects related to convexity
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimal packing and covering in the plane are NP-complete
- Unsolved problems in geometry
- MAXIMUM AREA INDEPENDENT SETS IN DISK INTERSECTION GRAPHS
- Approximation schemes for covering and packing problems in image processing and VLSI
- Polynomial-time approximation schemes for packing and piercing fat objects
- Polynomial-Time Approximation Schemes for Geometric Intersection Graphs
- Some Covering Theorems (III)
- Some Covering Theorems (I)
- Some Covering Theorems (II)