A Structural Lemma in 2-Dimensional Packing, and Its Implications on Approximability
From MaRDI portal
Publication:3652193
DOI10.1007/978-3-642-10631-6_10zbMath1272.52018OpenAlexW89929351MaRDI QIDQ3652193
Alberto Caprara, Lars Prädel, Nikhil Bansal, M. I. Sviridenko, Klaus Jansen
Publication date: 17 December 2009
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-10631-6_10
Related Items (10)
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 \((5/3+\varepsilon)\)-approximation for strip packing ⋮ A tight \((3/2+\varepsilon)\)-approximation for skewed strip packing ⋮ Tight approximation algorithms for geometric bin packing with skewed items ⋮ An improved approximation algorithm for scheduling monotonic moldable tasks ⋮ An approximation scheme for the two-stage, two-dimensional knapsack problem ⋮ A Tight (3/2+ε) Approximation for Skewed Strip Packing. ⋮ Online square-into-square packing
This page was built for publication: A Structural Lemma in 2-Dimensional Packing, and Its Implications on Approximability
