Lower bounds on the performance of online algorithms for relaxed packing problems
From MaRDI portal
Publication:2169944
Cites work
- A new and improved algorithm for online bin packing
- A new lower bound for classic online bin packing
- Approximation Algorithms for Demand Strip Packing
- Bin packing can be solved within 1+epsilon in linear time
- Fair versus unrestricted bin packing
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- scientific article; zbMATH DE number 1786227 (Why is no real title available?)
- scientific article; zbMATH DE number 2086630 (Why is no real title available?)
- Improved lower bounds for the online bin packing problem with cardinality constraints
- New lower bounds for certain classes of bin packing algorithms
- Offline first-fit decreasing height scheduling of power loads
- Online bin packing with cardinality constraints resolved
- Online knapsack revisited
- Peak Demand Minimization via Sliced Strip Packing.
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
Cited in
(6)- Improved Lower Bound for Online Strip Packing
- scientific article; zbMATH DE number 634028 (Why is no real title available?)
- Scheduling appointments online: the power of deferred decision-making
- Lower bounds on the performance of online algorithms for relaxed packing problems
- A survey of online knapsack problems
- Lower bounds on the performance of online algorithms for relaxed packing problems
This page was built for publication: Lower bounds on the performance of online algorithms for relaxed packing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2169944)
