Two-dimensional knapsack for circles

DOI10.1007/978-3-319-77404-6_54zbMATH Open1504.68261OpenAlexW2790940115MaRDI QIDQ2294732FDOQ2294732

Authors: Carla Negri Lintzmayer, Flávio K. Miyazawa, Eduardo C. Xavier 

Publication date: 12 February 2020

Full work available at URL: https://doi.org/10.1007/978-3-319-77404-6_54

Recommendations

• Polynomial-time approximation schemes for circle and other packing problems
• Parallel greedy algorithms for packing unequal circles into a strip or a rectangle
• Polynomial-time approximation schemes for circle packing problems
• An approximation scheme for the two-stage, two-dimensional knapsack problem
• 2D knapsack: packing squares

zbMATH Keywords

polynomial-time approximation schemecircle packingtwo-dimensional knapsack

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Cited In (5)

• Polynomial-time approximation schemes for circle packing problems
• Approximation schemes under resource augmentation for knapsack and packing problems of hyperspheres and other shapes
• Parallel greedy algorithms for packing unequal circles into a strip or a rectangle
• Polynomial-time approximation schemes for circle and other packing problems
• Techniques and results on approximation algorithms for packing circles

This page was built for publication: Two-dimensional knapsack for circles

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