Approximation algorithms for scheduling unrelated parallel machines
Mathematical Programming: Series A and B
A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem
Mathematics of Operations Research
Approximate Max-Min Resource Sharing for Structured Concave Optimization
SIAM Journal on Optimization
On Preemptive Resource Constrained Scheduling: Polynomial-Time Approximation Schemes
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
Strip packing with precedence constraints and strip packing with release times
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Packing Rectangles into 2OPT Bins Using Rotations
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Three-dimensional packings with rotations
Computers and Operations Research
Hardness of approximation for orthogonal rectangle packing and covering problems
Journal of Discrete Algorithms
Strip packing with precedence constraints and strip packing with release times
Theoretical Computer Science
Computers and Operations Research
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
Approximation algorithms for orthogonal packing problems for hypercubes
Theoretical Computer Science
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
Algorithms for 3D guillotine cutting problems: Unbounded knapsack, cutting stock and strip packing
Computers and Operations Research
AFPTAS Results for Common Variants of Bin Packing: A New Method for Handling the Small Items
SIAM Journal on Optimization
Inapproximability results for orthogonal rectangle packing problems with rotations
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Approximating the orthogonal knapsack problem for hypercubes
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Absolute approximation ratios for packing rectangles into bins
Journal of Scheduling
Rectangle packing with one-dimensional resource augmentation
Discrete Optimization
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
New approximability results for 2-dimensional packing problems
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
A Reinforced Tabu Search Approach for 2D Strip Packing
International Journal of Applied Metaheuristic Computing
| Hi-index | 0.00 |
We present an asymptotic fully polynomial time approximation scheme for two-dimensional strip packing with rotations. In this problem, a set of rectangles need to be packed into a rectangle (strip) of fixed width and minimum height, and these rectangles can be rotated by 90°. Additionally, we present a simple asymptotic polynomial time approximation scheme, and give an improved algorithm for two-dimensional bin packing with rotations.