Approximation schemes for geometric knapsack for packing spheres and fat objects
From MaRDI portal
Cites work
- A 3-approximation algorithm for maximum independent set of rectangles
- A formulation of the Kepler conjecture
- A literature review on circle and sphere packing problems: models and methodologies
- A PTAS for packing hypercubes into a knapsack
- A quasi-PTAS for the two-dimensional geometric knapsack problem
- A tutorial in irregular shape packing problems
- An improved algorithm for the packing of unequal circles within a larger containing circle
- Approximating Geometric Knapsack via L-packings
- Approximating maximum independent set for rectangles in the plane
- Approximation algorithms for maximum independent set of pseudo-disks
- Approximation schemes under resource augmentation for knapsack and packing problems of hyperspheres and other shapes
- Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
- Curved hexagonal packings of equal disks in a circle
- Framework for ER-completeness of two-dimensional packing problems
- Hardness of approximation for orthogonal rectangle packing and covering problems
- Hardness of approximation for strip packing
- scientific article; zbMATH DE number 432979 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- Improved approximation algorithm for two-dimensional bin packing
- Integrated container loading software for pulp and paper industry
- New approaches to circle packing in a square. With program codes.
- On the two-dimensional knapsack problem for convex polygons
- Packing disks into disks with optimal worst-case density
- Packing of 14, 16, 17 and 20 Circles in a Circle
- Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
- Solving circle packing problems by global optimization: numerical results and industrial applications
- Solving systems of polynomial inequalities in subexponential time
- Techniques and results on approximation algorithms for packing circles
- The densest packing of 13 congruent circles in a circle
- The sphere packing problem in dimension 8
- Tight approximation algorithms for geometric bin packing with skewed items
- Two-dimensional knapsack for circles
This page was built for publication: Approximation schemes for geometric knapsack for packing spheres and fat objects
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6875206)
