Techniques and results on approximation algorithms for packing circles
DOI10.1007/s40863-022-00301-3OpenAlexW4223423263WikidataQ121767341 ScholiaQ121767341MaRDI QIDQ2082050
Flávio K. Miyazawa, Yoshiko Wakabayashi
Publication date: 30 September 2022
Published in: São Paulo Journal of Mathematical Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40863-022-00301-3
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27) Circle packings and discrete conformal geometry (52C26)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Polynomial-time approximation schemes for circle and other packing problems
- A literature review on circle and sphere packing problems: models and methodologies
- The densest packing of equal circles into a parallel strip
- New approaches to circle packing in a square. With program codes.
- Interval methods for verifying structural optimality of circle packing configurations in the unit square
- Two-dimensional online bin packing with rotation
- Solving systems of polynomial inequalities in subexponential time
- Bin packing can be solved within 1+epsilon in linear time
- Approximation algorithms for combinatorial problems
- Improving dense packings of equal disks in a square
- Split packing: algorithms for packing circles with optimal worst-case density
- Two-dimensional packing problems: a survey
- New results in the packing of equal circles in a square
- Repeated patterns of dense packings of equal disks in a square
- Improved interval methods for solving circle packing problems in the unit square
- Two-dimensional knapsack for circles
- Approximation and online algorithms for multidimensional bin packing: a survey
- Online circle and sphere packing
- A proof of the Kepler conjecture
- Über einen geometrischen Satz
- Integer Programming with a Fixed Number of Variables
- Research Problems in Discrete Geometry
- On the online bin packing problem
- Shelf Algorithms for Two-Dimensional Packing Problems
- Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
- On Packing Two-Dimensional Bins
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- On the combinatorial and algebraic complexity of quantifier elimination
- Packing Geometric Objects with Optimal Worst-Case Density (Multimedia Exposition)
- A FORMAL PROOF OF THE KEPLER CONJECTURE
- On packing of squares and cubes
- Bounds for Certain Multiprocessing Anomalies
- Algorithms - ESA 2003
- Approximation of geometric dispersion problems
- A bounded space algorithm for online circle packing
This page was built for publication: Techniques and results on approximation algorithms for packing circles
