Improved Lower Bound for Online Strip Packing

DOI10.1007/978-3-642-29116-6_18MaRDI QIDQ2896391zbMATH OpenOpenAlexFDO

Authors Rolf Harren, Walter Kern

Publication date 16 July 2012

Published in Approximation and Online Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-29116-6_18

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Online algorithms; streaming algorithms (68W27) Combinatorial optimization (90C27)

Recommendations

• Improved lower bound for online strip packing
• A new lower bound for online strip packing
• New upper bounds for online strip packing
• A new upper bound for the online square packing problem in a strip
• An improved lower bound for on-line bin packing algorithms
• Improved lower bounds for the online bin stretching problem
• New bounds for online packing LPs
• Lower bounds on the performance of online algorithms for relaxed packing problems
• Improved lower bounds for the online bin packing problem with cardinality constraints
• Improved lower bounds for the online bin packing problem with cardinality constraints

Cited in

(12)

• A note on online strip packing
• A new upper bound for the online square packing problem in a strip
• Ordered strip packing
• Improved lower bound for online strip packing
• Approximation and online algorithms for multidimensional bin packing: a survey
• On a comparison between the strip packing problem and a scheduling problem
• A new lower bound for online strip packing
• The generalization of scheduling with machine cost
• scientific article; zbMATH DE number 33204 (Why is no real title available?)
• Creating worst-case instances for lower bounds of the 2D strip packing problem
• Online strip packing with modifiable boxes
• Improved upper bounds for online malleable job scheduling

This page was built for publication: Improved Lower Bound for Online Strip Packing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2896391)