New Approximability Results for 2-Dimensional Packing Problems
From MaRDI portal
Publication:3525560
DOI10.1007/978-3-540-74456-6_11zbMATH Open1147.68874OpenAlexW131027357MaRDI QIDQ3525560FDOQ3525560
Authors: Roberto Solis-Oba, Klaus Jansen 
Publication date: 17 September 2008
Published in: Mathematical Foundations of Computer Science 2007 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-74456-6_11
Recommendations
- New approximability results for two-dimensional bin packing
- New approximability results for two-dimensional bin packing
- New approximability and inapproximability results for 2-dimensional bin packing
- Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems
- Two-dimensional packing problems: a survey
- Recent advances on two-dimensional bin packing problems
- A structural lemma in 2-dimensional packing, and its implications on approximability
- The two-dimensional finite bin packing problem. II: New lower and upper bounds
- Improved approximation algorithm for two-dimensional bin packing
- New bounds for multidimensional packing
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)
Cited In (29)
- New approximability results for two-dimensional bin packing
- Approximation algorithms for orthogonal packing problems for hypercubes
- A tight \((3/2+\varepsilon)\)-approximation for skewed strip packing
- Title not available (Why is that?)
- A Tight (3/2+ε) Approximation for Skewed Strip Packing.
- A \((5/3+\varepsilon)\)-approximation for strip packing
- Approximation schemes for generalized two-dimensional vector packing with application to data placement
- Inapproximability Results for Orthogonal Rectangle Packing Problems with Rotations
- Rectangle packing with one-dimensional resource augmentation
- A \((2+\varepsilon)\)-approximation algorithm for the storage allocation problem
- On strip packing with rotations
- Approximation and online algorithms for multidimensional bin packing: a survey
- A new upper bound for unconstrained two-dimensional cutting and packing
- A \((5/3 + \varepsilon )\)-approximation for strip packing
- A structural lemma in 2-dimensional packing, and its implications on approximability
- Absolute approximation ratios for packing rectangles into bins
- A new nonlinear model for the two-dimensional rectangle packing problem
- Coordination mechanisms for selfish parallel jobs scheduling (extended abstract)
- LATIN 2004: Theoretical Informatics
- A note on the Kenyon-Remila strip-packing algorithm
- A near-optimal solution to a two-dimensional cutting stock problem
- An approximation algorithm with absolute worst-case performance ratio 2 for two-dimensional vector packing
- Two for One: Tight Approximation of 2D Bin Packing
- Packing Rectangles into 2OPT Bins Using Rotations
- Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems
- Approximation algorithms for multiple strip packing
- Parameterized complexity of strip packing and minimum volume packing
- High multiplicity strip packing with three rectangle types
- A Polynomial Time Approximation Scheme for the Square Packing Problem
This page was built for publication: New Approximability Results for 2-Dimensional Packing Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3525560)
