(Re)packing equal disks into rectangle

DOI10.1007/S00454-024-00633-1MaRDI QIDQ6642301zbMATH OpenFDO

Authors Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi

Publication date 22 November 2024

Published in Discrete \& Computational Geometry (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S00454-024-00633-1

zbMATH Keywords

circle packingcomputational geometrypacking of equal disks into a rectangleparameterized algorithmsunit disks

Mathematics Subject Classification ID

Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40)

Recommendations

• A POLYNOMIAL-TIME APPROXIMATION ALGORITHM FOR A GEOMETRIC DISPERSION PROBLEM
• Packing disks into disks with optimal worst-case density
• Packing disks into disks with optimal worst-case density
• Split packing: an algorithm for packing circles with optimal worst-case density
• Improving dense packings of equal disks in a square

Cites work

• A (5/3+)-approximation for strip packing
• A linear algorithm for 2-bend embeddings of planar graphs in the two-dimensional grid
• Approximating Geometric Knapsack via L-packings
• Approximation algorithms for NP-complete problems on planar graphs
• Approximation and online algorithms for multidimensional bin packing: a survey
• Approximation schemes for covering and packing problems in image processing and VLSI
• Color-coding
• Face covers and the genus problem for apex graphs
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1261820 (Why is no real title available?)
• scientific article; zbMATH DE number 3083197 (Why is no real title available?)
• Improved approximation algorithm for two-dimensional bin packing
• Introduction to algorithms.
• Kernelization. Theory of parameterized preprocessing
• More optimal packings of equal circles in a square
• New approaches to circle packing in a square. With program codes.
• New results in the packing of equal circles in a square
• Packing disks into disks with optimal worst-case density
• Packing equal circles in a square: A deterministic global optimization approach
• Packing up to 50 equal circles in a square
• Parameterized algorithms
• Parameterized complexity of strip packing and minimum volume packing
• Solving circle packing problems by global optimization: numerical results and industrial applications
• The Densest Packing of 9 Circles in a Square
• The Packing of Equal Circles in a Square

This page was built for publication: (Re)packing equal disks into rectangle

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