A tight (3/2+)-approximation for skewed strip packing
From MaRDI portal
Publication:6046946
DOI10.1007/S00453-023-01130-2OpenAlexW4376139533MaRDI QIDQ6046946FDOQ6046946
Authors: Waldo Gálvez, Fabrizio Grandoni, Afrouz Jabal Ameli, Klaus Jansen, Arindam Khan, Malin Rau 
Publication date: 6 October 2023
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-023-01130-2
Recommendations
- A Tight (3/2+ε) Approximation for Skewed Strip Packing.
- A \((5/3 + \varepsilon )\)-approximation for strip packing
- A \((5/3+\varepsilon)\)-approximation for strip packing
- On approximating strip packing with a better ratio than 3/2
- Approximate strip packing: revisited
- A new asymptotic approximation algorithm for 3-dimensional strip packing
- An approximation scheme for strip packing of rectangles with bounded dimensions
- The problem of strip packing: An asymptotically exact approach
- Improved pseudo-polynomial-time approximation for strip packing
- An exact approach to the strip-packing problem
Cites Work
- A near-optimal solution to a two-dimensional cutting stock problem
- A new asymptotic approximation algorithm for 3-dimensional strip packing
- On strip packing with rotations
- Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems
- Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
- A Strip-Packing Algorithm with Absolute Performance Bound 2
- Approximating Geometric Knapsack via L-packings
- Improved Approximation Algorithm for Two-Dimensional Bin Packing
- Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
- A \((5/3+\varepsilon)\)-approximation for strip packing
- Maximizing the total profit of rectangles packed into a rectangle
- A structural lemma in 2-dimensional packing, and its implications on approximability
- Orthogonal Packings in Two Dimensions
- `` Strong NP-Completeness Results
- Title not available (Why is that?)
- A 2.5 times optimal algorithm for packing in two dimensions
- A quasi-PTAS for the two-dimensional geometric knapsack problem
- Title not available (Why is that?)
- New Approximability Results for 2-Dimensional Packing Problems
- Approximation algorithms for maximum independent set of pseudo-disks
- LATIN 2004: Theoretical Informatics
- Approximation and online algorithms for multidimensional bin packing: a survey
- Hardness of Approximation for Strip Packing
- This side up!
- On Guillotine Separability of Squares and Rectangles.
- Asymptotically optimal scheduling of random malleable demands in smart grid
- Closing the Gap for Pseudo-Polynomial Strip Packing
- Complexity and inapproximability results for parallel task scheduling and strip packing
- Improved approximation for two dimensional strip packing with polynomial bounded width
- On approximating strip packing with a better ratio than 3/2
- Improved Pseudo-Polynomial-Time Approximation for Strip Packing
Cited In (1)
This page was built for publication: A tight \((3/2+\varepsilon)\)-approximation for skewed strip packing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6046946)
