Closing the Gap for Pseudo-Polynomial Strip Packing

Related Items (7)

A tight $(3/2+\varepsilon)$-approximation for skewed strip packing ⋮ Peak demand minimization via sliced strip packing ⋮ An improved approximation algorithm for scheduling monotonic moldable tasks ⋮ Approximation algorithms for scheduling monotonic moldable tasks on multiple platforms ⋮ An improved algorithm for parallel machine scheduling under additional resource constraints ⋮ A Tight (3/2+ε) Approximation for Skewed Strip Packing. ⋮ Exact solution techniques for two-dimensional cutting and packing

Cites Work

Unnamed Item
Unnamed Item
A $(5/3+\varepsilon)$-approximation for strip packing
A note on the Kenyon-Remila strip-packing algorithm
Rectangle packing with one-dimensional resource augmentation
A 2.5 times optimal algorithm for packing in two dimensions
Improved approximation for two dimensional strip packing with polynomial bounded width
Approximation and online algorithms for multidimensional bin packing: a survey
A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem
APPROXIMATION ALGORITHMS FOR MULTIPLE STRIP PACKING AND SCHEDULING PARALLEL JOBS IN PLATFORMS
Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems
Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
Orthogonal Packings in Two Dimensions
Performance Bounds for Orthogonal Oriented Two-Dimensional Packing Algorithms
A algorithm for two-dimensional packing
A Strip-Packing Algorithm with Absolute Performance Bound 2
On approximating strip packing with a better ratio than 3/2
Faster approximation schemes for the two-dimensional knapsack problem
To Augment or Not to Augment: Solving Unsplittable Flow on a Path by Creating Slack
Improved Pseudo-Polynomial-Time Approximation for Strip Packing
Hardness of Approximation for Strip Packing
A (1+epsilon)-Approximation for Unsplittable Flow on a Path in Fixed-Parameter Running Time
A (5/3 + ε)-approximation for unsplittable flow on a path: placing small tasks into boxes
A quasi-PTAS for the Two-Dimensional Geometric Knapsack Problem
Improved Approximation Algorithm for Two-Dimensional Bin Packing
On the optimality of approximation schemes for the classical scheduling problem
A $\frac32$‐Approximation Algorithm for Scheduling Independent Monotonic Malleable Tasks
Approximation Algorithms for Scheduling Parallel Jobs
Complexity and inapproximability results for parallel task scheduling and strip packing

This page was built for publication: Closing the Gap for Pseudo-Polynomial Strip Packing