Polynomial-time approximation schemes for circle packing problems

DOI10.1007/978-3-662-44777-2_59MaRDI QIDQ2921456zbMATH OpenOpenAlexFDO

Authors Flávio K. Miyazawa, Lehilton L. C. Pedrosa, Rafael C. S. Schouery, Maxim Sviridenko, 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

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

Recommendations

• Polynomial-time approximation schemes for circle and other packing problems
• Online circle and sphere packing
• Two-dimensional knapsack for circles
• Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
• Approximation schemes for multidimensional packing

This page was built for publication: Polynomial-time approximation schemes for circle packing problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2921456)