An approximation scheme for strip packing of rectangles with bounded dimensions
From MaRDI portal
Publication:1383370
DOI10.1016/S0166-218X(97)00130-3zbMATH Open0894.68114MaRDI QIDQ1383370FDOQ1383370
V. Zissimopoulos, W. Fernandez de la Vega
Publication date: 12 August 1998
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: http://www.elsevier.com/locate/dam
Recommendations
- A \((5/3 + \varepsilon )\)-approximation for strip packing
- A Strip-Packing Algorithm with Absolute Performance Bound 2
- A \((5/3+\varepsilon)\)-approximation for strip packing
- New Approximability Results for 2-Dimensional Packing Problems
- Improved approximation for two dimensional strip packing with polynomial bounded width
Discrete mathematics in relation to computer science (68R99) Combinatorial aspects of packing and covering (05B40)
Cites Work
- Bin packing can be solved within 1+epsilon in linear time
- Integer Programming with a Fixed Number of Variables
- Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
- Orthogonal Packings in Two Dimensions
- A algorithm for two-dimensional packing
- Time bounds for selection
- The NP-completeness column: An ongoing guide
Cited In (14)
- A tight \((3/2+\varepsilon)\)-approximation for skewed strip packing
- Title not available (Why is that?)
- An L-approach for packing (ℓ, w)-rectangles into rectangular and L-shaped pieces
- An exact method for the 2D guillotine strip packing problem
- Strip packing with precedence constraints and strip packing with release times
- Approximate strip packing: revisited
- Models of the nonguillotine sheet and strip rectangular packing problem
- Two-dimensional packing problems: a survey
- A near-optimal solution to a two-dimensional cutting stock problem
- An approximation scheme for scheduling independent jobs into subcubes of a hypercube of fixed dimension
- A \(\frac 54\)-approximation algorithm for scheduling identical malleable tasks
- The two-dimensional cutting stock problem revisited
- Title not available (Why is that?)
- On approximating strip packing with a better ratio than 3/2
This page was built for publication: An approximation scheme for strip packing of rectangles with bounded dimensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1383370)
