Approximation algorithms for orthogonal packing problems for hypercubes
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- scientific article; zbMATH DE number 2107164 (Why is no real title available?)
- A New Approximation Method for Set Covering Problems, with Applications to Multidimensional Bin Packing
- A Polynomial Time Approximation Scheme for the Square Packing Problem
- A near-optimal solution to a two-dimensional cutting stock problem
- Algorithm Theory - SWAT 2004
- Algorithms and Computation
- An asymptotic approximation algorithm for 3D-strip packing
- Approximating the Orthogonal Knapsack Problem for Hypercubes
- Approximating the advertisement placement problem
- Approximation Algorithms for 3D Orthogonal Knapsack
- Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
- Bin packing can be solved within 1+epsilon in linear time
- Combinatorial optimization. Theory and algorithms.
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- Fast Approximation Schemes for Two-Stage, Two-Dimensional Bin Packing
- Harmonic algorithm for \(3\)-dimensional strip packing problem
- Inapproximability Results for Orthogonal Rectangle Packing Problems with Rotations
- Mathematical Foundations of Computer Science 2005
- Maximizing the total profit of rectangles packed into a rectangle
- New Approximability Results for 2-Dimensional Packing Problems
- On packing of squares and cubes
- On strip packing with rotations
- On the two-dimensional knapsack problem
Cited in
(14)- Efficient algorithms for orthogonal packing problems
- On the weak computability of a four dimensional orthogonal packing and time scheduling problem
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
- Efficient 1-space bounded hypercube packing algorithm
- 2D knapsack: packing squares
- Approximation schemes under resource augmentation for knapsack and packing problems of hyperspheres and other shapes
- Approximation Algorithms for the Orthogonal Z-Oriented Three-Dimensional Packing Problem
- MPQ-trees for orthogonal packing problem
- Packing cubes into a cube is NP-complete in the strong sense
- 2D knapsack: packing squares
- Approximating the Orthogonal Knapsack Problem for Hypercubes
- Approximation Algorithms for 3D Orthogonal Knapsack
- Approximation schemes for multidimensional packing
- Packing cubes into a cube in \((D>3)\)-dimensions
This page was built for publication: Approximation algorithms for orthogonal packing problems for hypercubes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1035685)
