On the complexity of asymptotically optimal coverings and packings
From MaRDI portal
Publication:1594186
zbMath0960.05034MaRDI QIDQ1594186
Publication date: 28 January 2001
Published in: Doklady Mathematics (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Combinatorial aspects of packing and covering (05B40)
Related Items (3)
Numerical optimization method for packing regular convex polygons ⋮ On the Number and Arrangement of Sensors for the Multiple Covering of Bounded Plane Domains ⋮ Optimization of the number and arrangement of circles of two radii for forming a \(k\)-covering of a bounded set
This page was built for publication: On the complexity of asymptotically optimal coverings and packings
