Approximation schemes for multidimensional packing
From MaRDI portal
Recommendations
Cited in
(27)- Approximation algorithms for orthogonal packing problems for hypercubes
- Real time asymptotic packing
- Multidimensional cube packing
- Fast approximate PCPs for multidimensional bin-packing problems
- Packing cubes into a cube is NP-complete in the strong sense
- Multidimensional cube packing
- Robust approximation schemes for cube packing
- Polynomial-time approximation schemes for circle packing problems
- Polynomial approximation schemes for smoothed and random instances of multidimensional packing problems
- Packing cubes into a cube in \((D>3)\)-dimensions
- Polynomial-time approximation schemes for circle and other packing problems
- Bidimensional Packing by Bilinear Programming
- Approximating the Orthogonal Knapsack Problem for Hypercubes
- Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems
- A structural lemma in 2-dimensional packing, and its implications on approximability
- Approximation schemes for generalized two-dimensional vector packing with application to data placement
- scientific article; zbMATH DE number 1305407 (Why is no real title available?)
- scientific article; zbMATH DE number 6850331 (Why is no real title available?)
- On Multidimensional Packing Problems
- scientific article; zbMATH DE number 1830743 (Why is no real title available?)
- Approximation Schemes for Covering and Packing
- Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
- Packing d-Dimensional Bins in d Stages
- Higher‐Dimensional Packing with Order Constraints
- An approximation algorithm for square packing.
- Online multiple resource allocation problems with departures via the primal-dual approach
- Two- and three-dimensional parametric packing
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)
