A Tight (3/2+ε) Approximation for Skewed Strip Packing.
From MaRDI portal
Publication:6084400
DOI10.4230/lipics.approx/random.2020.44OpenAlexW3081662680MaRDI QIDQ6084400
Klaus Jansen, Malin Rau, Waldo Gálvez, Arindam Khan, Afrouz Jabal Ameli, Fabrizio Grandoni
Publication date: 31 October 2023
Full work available at URL: https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.44
Related Items (2)
Tight approximation algorithms for geometric bin packing with skewed items ⋮ Peak demand minimization via sliced strip packing
Cites Work
- Unnamed Item
- Unnamed Item
- A \((5/3+\varepsilon)\)-approximation for strip packing
- Approximation algorithms for maximum independent set of pseudo-disks
- Maximizing the total profit of rectangles packed into a rectangle
- A 2.5 times optimal algorithm for packing in two dimensions
- Improved approximation for two dimensional strip packing with polynomial bounded width
- Approximation and online algorithms for multidimensional bin packing: a survey
- A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem
- A New Asymptotic Approximation Algorithm for 3-Dimensional Strip Packing
- This side up!
- New Approximability Results for 2-Dimensional Packing Problems
- On strip packing With rotations
- Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems
- A Structural Lemma in 2-Dimensional Packing, and Its Implications on Approximability
- Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
- Orthogonal Packings in Two Dimensions
- `` Strong NP-Completeness Results
- A Strip-Packing Algorithm with Absolute Performance Bound 2
- On approximating strip packing with a better ratio than 3/2
- Improved Approximation for Vector Bin Packing
- Improved Pseudo-Polynomial-Time Approximation for Strip Packing
- Hardness of Approximation for Strip Packing
- Closing the Gap for Pseudo-Polynomial Strip Packing
- A quasi-PTAS for the Two-Dimensional Geometric Knapsack Problem
- Improved Approximation Algorithm for Two-Dimensional Bin Packing
- Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
- LATIN 2004: Theoretical Informatics
- Complexity and inapproximability results for parallel task scheduling and strip packing
This page was built for publication: A Tight (3/2+ε) Approximation for Skewed Strip Packing.
