Approximation schemes for multidimensional packing
From MaRDI portal
Publication:5501258
Recommendations
Cited in
(26)- Approximation algorithms for orthogonal packing problems for hypercubes
- Robust approximation schemes for cube packing
- Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
- Packing d-Dimensional Bins in d Stages
- Polynomial-time approximation schemes for circle packing problems
- Higher‐Dimensional Packing with Order Constraints
- Packing cubes into a cube is NP-complete in the strong sense
- Approximation schemes for generalized two-dimensional vector packing with application to data placement
- On Multidimensional Packing Problems
- Polynomial approximation schemes for smoothed and random instances of multidimensional packing problems
- Multidimensional cube packing
- Fast approximate PCPs for multidimensional bin-packing problems
- Polynomial-time approximation schemes for circle and other packing problems
- An approximation algorithm for square packing.
- A structural lemma in 2-dimensional packing, and its implications on approximability
- scientific article; zbMATH DE number 1305407 (Why is no real title available?)
- Two- and three-dimensional parametric packing
- Packing cubes into a cube in \((D>3)\)-dimensions
- Approximating the Orthogonal Knapsack Problem for Hypercubes
- scientific article; zbMATH DE number 1830743 (Why is no real title available?)
- Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems
- Multidimensional cube packing
- Approximation Schemes for Covering and Packing
- Real time asymptotic packing
- scientific article; zbMATH DE number 6850331 (Why is no real title available?)
- Bidimensional Packing by Bilinear Programming
This page was built for publication: Approximation schemes for multidimensional packing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501258)
