On Covering Problems of Rado
From MaRDI portal
Publication:3512467
DOI10.1007/978-3-540-69903-3_27zbMATH Open1155.68545OpenAlexW4236166745MaRDI QIDQ3512467FDOQ3512467
Authors: Sergey Bereg, Adrian Dumitrescu, Minghui 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
Recommendations
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects related to convexity (52B55)
Cites Work
- Unsolved problems in geometry
- Approximation schemes for covering and packing problems in image processing and VLSI
- Title not available (Why is that?)
- Optimal packing and covering in the plane are NP-complete
- Polynomial-time approximation schemes for packing and piercing fat objects
- Maximum area independent sets in disk intersection graphs
- Title not available (Why is that?)
- Polynomial-Time Approximation Schemes for Geometric Intersection Graphs
- Some Covering Theorems (I)
- Some Covering Theorems (III)
- Some Covering Theorems (II)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (6)
This page was built for publication: On Covering Problems of Rado
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3512467)