A Strip-Packing Algorithm with Absolute Performance Bound 2
From MaRDI portal
Publication:4337640
DOI10.1137/S0097539793255801zbMATH Open0874.68140OpenAlexW2059422698MaRDI QIDQ4337640FDOQ4337640
Author name not available (Why is that?)
Publication date: 26 May 1997
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0097539793255801
Recommendations
- A \((5/3+\varepsilon)\)-approximation for strip packing
- An approximation scheme for strip packing of rectangles with bounded dimensions
- A \((5/3 + \varepsilon )\)-approximation for strip packing
- Approximation algorithms for multiple strip packing
- New Approximability Results for 2-Dimensional Packing Problems
Cited In (66)
- New upper bounds for online strip packing
- New approximability results for two-dimensional bin packing
- UPS-\(k\): a set partitioning problem with applications in UPS pickup-delivery system
- TWO FOR ONE: TIGHT APPROXIMATION OF 2D BIN PACKING
- Complexity and inapproximability results for parallel task scheduling and strip packing
- Packing anchored rectangles
- Approximability results for the resource-constrained project scheduling problem with a single type of resources
- A \((5/3+\varepsilon)\)-approximation for strip packing
- Linear Time Algorithms for Multiple Cluster Scheduling and Multiple Strip Packing
- Rectangle packing with one-dimensional resource augmentation
- An approximation scheme for the two-stage, two-dimensional knapsack problem
- Approximate Truthful Mechanism Design for Two-Dimensional Orthogonal Knapsack Problem
- On-line scheduling of parallel jobs
- Approximation algorithms for two-stage flexible flow shop scheduling
- An effective approximation algorithm for the malleable parallel task scheduling problem
- A two-phase heuristic for strip packing: Algorithm and probabilistic analysis
- On-line scheduling mesh jobs with dependencies
- Recent advances on two-dimensional bin packing problems
- On the Approximability of Orthogonal Order Preserving Layout Adjustment
- Peak demand minimization via sliced strip packing
- Approximation and online algorithms for multidimensional bin packing: a survey
- Approximating Minimum-Area Rectangular and Convex Containers for Packing Convex Polygons
- Average-case performance analysis of a 2D strip packing algorithm -- NFDH
- An approximation algorithm for scheduling trees of malleable tasks
- Upper bounds for heuristic approaches to the strip packing problem
- Strip packing with precedence constraints and strip packing with release times
- Upper Bounds for Heuristic Approaches to the Strip Packing Problem
- A new lower bound for online strip packing
- Polynomial-time approximation schemes for circle and other packing problems
- An approximation algorithm for square packing.
- Two-bar charts packing problem
- On contiguous and non-contiguous parallel task scheduling
- Absolute approximation ratios for packing rectangles into bins
- Improved approximation for two dimensional strip packing with polynomial bounded width
- On the two-dimensional knapsack problem
- A 3-approximation algorithm for two-dimensional bin packing
- Online multiple-strip packing
- Two-dimensional packing problems: a survey
- Online square packing with gravity
- The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview
- On-line scheduling of parallel jobs in a list
- Scheduling parallel jobs to minimize the makespan
- Approximate composable truthful mechanism design
- Approximation algorithms for multiple strip packing and scheduling parallel jobs in platforms
- A note on online strip packing
- The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio
- A \(\frac 54\)-approximation algorithm for scheduling identical malleable tasks
- Two for One: Tight Approximation of 2D Bin Packing
- Packing Rectangles into 2OPT Bins Using Rotations
- Relations between capacity utilization, minimal bin size and bin number
- Improved approximation algorithms for scheduling parallel jobs on identical clusters
- Packing into the smallest square: worst-case analysis of lower bounds
- Global optimization approach to unequal global optimization approach to unequal sphere packing problems in 3D
- Approximation algorithms for multiple strip packing
- Coordination Mechanisms for Selfish Parallel Jobs Scheduling
- Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width
- Closing the Gap for Pseudo-Polynomial Strip Packing
- A tight \((3/2+\varepsilon)\)-approximation for skewed strip packing
- A Tight (3/2+ε) Approximation for Skewed Strip Packing.
- An improved approximation for packing big two-bar charts
- Tight approximation algorithms for geometric bin packing with skewed items
- An improved approximation algorithm for scheduling monotonic moldable tasks
- A Posteriori Analysis of the Algorithms for Two-Bar Charts Packing Problem
- High multiplicity strip packing with three rectangle types
- Efficient approximation algorithms for scheduling moldable tasks
- Title not available (Why is that?)
This page was built for publication: A Strip-Packing Algorithm with Absolute Performance Bound 2
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4337640)
