On covering problems of Rado

DOI10.1007/s00453-009-9298-zzbMath1201.68136OpenAlexW2084366058WikidataQ59485429 ScholiaQ59485429MaRDI QIDQ970613

Adrian Dumitrescu, Ming-Hui Jiang, Sergey Bereg

Publication date: 19 May 2010

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-009-9298-z

zbMATH Keywords

discrete geometrycomputational geometryapproximation algorithms

Mathematics Subject Classification ID

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

Related Items

Disjoint empty disks supported by a point set, Piercing translates and homothets of a convex body, Anchored rectangle and square packings, On the complexity of anchored rectangle packing

Cites Work

• Optimal packing and covering in the plane are NP-complete
• Unsolved problems in geometry
• Research Problems in Discrete 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)
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item