A Strip-Packing Algorithm with Absolute Performance Bound 2
SIAM Journal on Computing
A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem
Mathematics of Operations Research
Reverse-Fit: A 2-Optimal Algorithm for Packing Rectangles
ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
Mathematics of Operations Research
Approximation Algorithms for Scheduling Parallel Jobs: Breaking the Approximation Ratio of 2
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
Two for One: Tight Approximation of 2D Bin Packing
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
A Structural Lemma in 2-Dimensional Packing, and Its Implications on Approximability
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
SIAM Journal on Computing
Rectangle packing with one-dimensional resource augmentation
Discrete Optimization
Scheduling jobs on heterogeneous platforms
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Approximation algorithms for scheduling and packing problems
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
On-Line scheduling of parallel jobs in heterogeneous multiple clusters
FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
Coordination mechanisms for selfish parallel jobs scheduling
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Smart-Grid electricity allocation via strip packing with slicing
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
Hi-index | 0.00 |
We study strip packing, which is one of the most classical two-dimensional packing problems: Given a collection of rectangles, the problem is to find a feasible orthogonal packing without rotations into a strip of width 1 and minimum height. In this paper we present an approximation algorithm for the strip packing problem with approximation ratio of 5/3 + ε for any ε 0. This result significantly narrows the gap between the best known upper bounds of 2 by Schiermeyer and Steinberg and 1.9396 by Harren and van Stee and the lower bound of 3/2.