Polynomial-Time Approximation Schemes for Circle Packing Problems

DOI10.1007/978-3-662-44777-2_59zbMath1425.68437OpenAlexW349093217MaRDI QIDQ2921456

M. I. Sviridenko, Lehilton L. C. Pedrosa, Rafael C. S. Schouery, Flávio K. Miyazawa, Yoshiko Wakabayashi

Publication date: 8 October 2014

Published in: Algorithms - ESA 2014 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-44777-2_59

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Approximation algorithms (68W25)

Related Items (4)

Packing disks into disks with optimal worst-case density ⋮ Split packing: algorithms for packing circles with optimal worst-case density ⋮ Unnamed Item ⋮ A bounded space algorithm for online circle packing

This page was built for publication: Polynomial-Time Approximation Schemes for Circle Packing Problems