New Approximability Results for 2-Dimensional Packing Problems
From MaRDI portal
Publication:3525560
DOI10.1007/978-3-540-74456-6_11zbMath1147.68874OpenAlexW131027357MaRDI QIDQ3525560
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
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)
Related Items (11)
Coordination Mechanisms for Selfish Parallel Jobs Scheduling ⋮ A $$(2+\epsilon )$$-Approximation Algorithm for the Storage Allocation Problem ⋮ Two for One: Tight Approximation of 2D Bin Packing ⋮ Approximation and online algorithms for multidimensional bin packing: a survey ⋮ A tight \((3/2+\varepsilon)\)-approximation for skewed strip packing ⋮ Packing Rectangles into 2OPT Bins Using Rotations ⋮ Absolute approximation ratios for packing rectangles into bins ⋮ A Tight (3/2+ε) Approximation for Skewed Strip Packing. ⋮ Online square-into-square packing ⋮ A note on the Kenyon-Remila strip-packing algorithm ⋮ Approximation algorithms for orthogonal packing problems for hypercubes
This page was built for publication: New Approximability Results for 2-Dimensional Packing Problems
