Approximation algorithms for orthogonal packing problems for hypercubes
From MaRDI portal
Publication:1035685
DOI10.1016/J.TCS.2009.07.030zbMATH Open1187.68708OpenAlexW1976115962MaRDI QIDQ1035685FDOQ1035685
Authors: Rolf Harren 
Publication date: 4 November 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2009.07.030
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Bin packing can be solved within 1+epsilon in linear time
- A near-optimal solution to a two-dimensional cutting stock problem
- On strip packing with rotations
- A New Approximation Method for Set Covering Problems, with Applications to Multidimensional Bin Packing
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
- Harmonic algorithm for \(3\)-dimensional strip packing problem
- A Polynomial Time Approximation Scheme for the Square Packing Problem
- Maximizing the total profit of rectangles packed into a rectangle
- On the two-dimensional knapsack problem
- Inapproximability Results for Orthogonal Rectangle Packing Problems with Rotations
- An asymptotic approximation algorithm for 3D-strip packing
- On packing of squares and cubes
- Combinatorial optimization. Theory and algorithms.
- Algorithm Theory - SWAT 2004
- Mathematical Foundations of Computer Science 2005
- New Approximability Results for 2-Dimensional Packing Problems
- Fast Approximation Schemes for Two-Stage, Two-Dimensional Bin Packing
- Approximating the advertisement placement problem
- Approximating the Orthogonal Knapsack Problem for Hypercubes
- Approximation Algorithms for 3D Orthogonal Knapsack
- Algorithms and Computation
Cited In (14)
- On the weak computability of a four dimensional orthogonal packing and time scheduling problem
- Approximation schemes under resource augmentation for knapsack and packing problems of hyperspheres and other shapes
- Packing cubes into a cube is NP-complete in the strong sense
- 2D knapsack: packing squares
- MPQ-trees for orthogonal packing problem
- Approximation schemes for multidimensional packing
- Efficient algorithms for orthogonal packing problems
- Packing cubes into a cube in \((D>3)\)-dimensions
- Approximating the Orthogonal Knapsack Problem for Hypercubes
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
- Approximation Algorithms for the Orthogonal Z-Oriented Three-Dimensional Packing Problem
- Approximation Algorithms for 3D Orthogonal Knapsack
- Efficient 1-space bounded hypercube packing algorithm
- 2D knapsack: packing squares
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)
