Approximate algorithms to pack rectangles into several strips

DOI10.1515/156939206776241264zbMath1111.68151OpenAlexW2065549919MaRDI QIDQ5491240

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) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (14)

Coordination Mechanisms for Selfish Parallel Jobs Scheduling ⋮ APPROXIMATION ALGORITHMS FOR MULTIPLE STRIP PACKING AND SCHEDULING PARALLEL JOBS IN PLATFORMS ⋮ A new lower bound for online strip packing ⋮ Approximate composable truthful mechanism design ⋮ Approximate Truthful Mechanism Design for Two-Dimensional Orthogonal Knapsack Problem ⋮ Online multiple-strip packing ⋮ Approximation algorithms for scheduling monotonic moldable tasks on multiple platforms ⋮ On online algorithms for bin, strip, and box packing, and their worst-case and average-case analysis ⋮ Linear Time Algorithms for Multiple Cluster Scheduling and Multiple Strip Packing ⋮ Improved approximation algorithms for scheduling parallel jobs on identical clusters ⋮ Scheduling parallel jobs on heterogeneous platforms ⋮ New upper bounds for online strip packing ⋮ Numerical optimization method for packing regular convex polygons ⋮ On-line algorithms for packing rectangles into several strips

Cites Work

• Unnamed Item
• A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem
• Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
• Orthogonal Packings in Two Dimensions
• A algorithm for two-dimensional packing

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