An Approximation Scheme for the Two-Stage, Two-Dimensional Bin Packing Problem
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Scheduling Malleable Parallel Tasks: An Asymptotic Fully Polynomial-Time Approximation Scheme
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Recent advances on two-dimensional bin packing problems
Discrete Applied Mathematics
Polynomial time approximation schemes for general multiprocessor job shop scheduling
Journal of Algorithms
Approximation schemes for multidimensional packing
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
On strip packing With rotations
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
A Tale of Two Dimensional Bin Packing
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
An asymptotic approximation algorithm for 3D-strip packing
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Strip packing with precedence constraints and strip packing with release times
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Faster and simpler approximation algorithms for mixed packing and covering problems
Theoretical Computer Science
Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
Mathematics of Operations Research
Harmonic algorithm for 3-dimensional strip packing problem
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem
Computers and Operations Research
Large gaps in one-dimensional cutting stock problems
Discrete Applied Mathematics
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
Packing Rectangles into 2OPT Bins Using Rotations
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Commitment under uncertainty: Two-stage stochastic matching problems
Theoretical Computer Science
Improved approximation algorithms for scheduling with fixed jobs
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Three-dimensional packings with rotations
Computers and Operations Research
Hardness of approximation for orthogonal rectangle packing and covering problems
Journal of Discrete Algorithms
A Survey on Approximation Algorithms for Scheduling with Machine Unavailability
Algorithmics of Large and Complex Networks
Strip packing with precedence constraints and strip packing with release times
Theoretical Computer Science
Two for One: Tight Approximation of 2D Bin Packing
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
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
Approximation algorithms for 3D orthogonal Knapsack
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
A polynomial time approximation scheme for the square packing problem
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
The train delivery problem: vehicle routing meets bin packing
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
SIAM Journal on Computing
Algorithms for 3D guillotine cutting problems: Unbounded knapsack, cutting stock and strip packing
Computers and Operations Research
Scheduling jobs on heterogeneous platforms
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
A (5/3 + ε)-approximation for strip packing
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
A note on the Kenyon-Remila strip-packing algorithm
Information Processing Letters
Approximation Algorithms for Scheduling Parallel Jobs
SIAM Journal on Computing
Two level job-scheduling strategies for a computational grid
PPAM'05 Proceedings of the 6th international conference on Parallel Processing and Applied Mathematics
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
Approximation algorithms for multiple strip packing
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
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
An effective approximation algorithm for the Malleable Parallel Task Scheduling problem
Journal of Parallel and Distributed Computing
A fast approximation scheme for the multiple knapsack problem
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Resource augmentation in two-dimensional packing with orthogonal rotations
Operations Research Letters
Two-dimensional bin packing with one-dimensional resource augmentation
Discrete Optimization
Rectangle packing with one-dimensional resource augmentation
Discrete Optimization
A 3-approximation algorithm for two-dimensional bin packing
Operations Research Letters
A(3/2+ε) approximation algorithm for scheduling moldable and non-moldable parallel tasks
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
SIAM Journal on Discrete Mathematics
Multi-dimensional packing with conflicts
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
New approximability results for 2-dimensional packing problems
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Commitment under uncertainty: two-stage stochastic matching problems
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Corner cuts are close to optimal: From solid grids to polygons and back
Discrete Applied Mathematics
Smart-Grid electricity allocation via strip packing with slicing
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
A (2+ε)-approximation for scheduling parallel jobs in platforms
Euro-Par'13 Proceedings of the 19th international conference on Parallel Processing
A (5/3+ε )-approximation for strip packing
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |
We present an asymptotic fully polynomial approximation scheme for strip-packing, or packing rectangles into a rectangle of fixed width and minimum height, a classicalNP-hard cutting-stock problem. The algorithm, based on a new linear-programming relaxation, finds a packing ofn rectangles whose total height is within a factor of (1 +e) of optimal (up to an additive term), and has running time polynomial both in n and in 1/ e.