Approximate algorithms to pack rectangles into several strips

DOI10.1515/156939206776241264MaRDI QIDQ5491240zbMATH OpenOpenAlexFDO

Authors S. N. Zhuk

Publication date 10 October 2006

Published in Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/156939206776241264

zbMATH Keywords

widths

Mathematics Subject Classification ID

Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Randomized algorithms (68W20) Approximation algorithms (68W25)

Recommendations

• On-line algorithms for packing rectangles into several strips
• On-Line Multiple-Strip Packing
• Online multiple-strip packing
• scientific article; zbMATH DE number 3904609
• A Strip-Packing Algorithm with Absolute Performance Bound 2

Cites work

• A algorithm for two-dimensional packing
• A near-optimal solution to a two-dimensional cutting stock problem
• scientific article; zbMATH DE number 1167865 (Why is no real title available?)
• Orthogonal Packings in Two Dimensions
• Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms

Cited in

(19)

• New upper bounds for online strip packing
• On online algorithms for bin, strip, and box packing, and their worst-case and average-case analysis
• Coordination mechanisms for selfish parallel jobs scheduling (extended abstract)
• Probabilistic analysis of a new class of strip packing algorithms
• Approximation algorithms for multiple strip packing and scheduling parallel jobs in platforms
• Approximate truthful mechanism design for two-dimensional orthogonal knapsack problem
• A new lower bound for online strip packing
• Linear time algorithms for multiple cluster scheduling and multiple strip packing
• Approximate composable truthful mechanism design
• On-Line Multiple-Strip Packing
• scientific article; zbMATH DE number 3904609 (Why is no real title available?)
• scientific article; zbMATH DE number 1982176 (Why is no real title available?)
• Improved approximation algorithms for scheduling parallel jobs on identical clusters
• Scheduling parallel jobs on heterogeneous platforms
• Numerical optimization method for packing regular convex polygons
• On-line algorithms for packing rectangles into several strips
• Approximation algorithms for scheduling monotonic moldable tasks on multiple platforms
• Online multiple-strip packing
• An approximation algorithm for sequential rectangle placement

This page was built for publication: Approximate algorithms to pack rectangles into several strips

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5491240)