On approximating rectangle tiling and packing
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Linear-time approximation schemes for scheduling malleable parallel tasks
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
On Preemptive Resource Constrained Scheduling: Polynomial-Time Approximation Schemes
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Preemptive Parallel Task Scheduling in O(n)+Poly(m) Time
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Approximation Algorithms for Fractional Covering and Packing Problems, and Applications
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
New approximability and inapproximability results for 2-dimensional Bin Packing
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Exhaustive approaches to 2D rectangular perfect packings
Information Processing Letters
On packing squares with resource augmentation: maximizing the profit
CATS '05 Proceedings of the 2005 Australasian symposium on Theory of computing - Volume 41
New heuristic and interactive approaches to 2D rectangular strip packing
Journal of Experimental Algorithmics (JEA)
Scheduling parallel jobs to minimize the makespan
Journal of Scheduling
A 5/4-approximation algorithm for scheduling identical malleable tasks
Theoretical Computer Science - Approximation and online algorithms
On-line scheduling of parallel jobs in a list
Journal of Scheduling
Improved approximation algorithms for scheduling with fixed jobs
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Maintaining arrays of contiguous objects
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
On efficient weighted rectangle packing with large resources
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Packing weighted rectangles into a square
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
On improved least flexibility first heuristics superior for packing and stock cutting problems
SAGA'05 Proceedings of the Third international conference on StochasticAlgorithms: foundations and applications
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
E-BLOW: e-beam lithography overlapping aware stencil planning for MCC system
Proceedings of the 50th Annual Design Automation Conference
| Hi-index | 0.00 |
We present an approximation scheme for strip-packing, or packing rectangles into a rectangle of fixed width and minimum height, a classical NP-hard cutting-stock problem. The algorithm finds a packing of n rectangles whose total height is within a factor of (1+/spl epsiv/) of optimal, and has running time polynomial both in n and in 1//spl epsiv/. It is based on a reduction to fractional bin-packing, and can be performed by 5 stages of guillotine cuts.