A tight analysis of Brown-Baker-Katseff sequences for online strip packing

DOI10.1007/S10878-012-9463-1zbMATH Open1275.90081OpenAlexW2152360290MaRDI QIDQ2392732FDOQ2392732

Authors: Walter Kern, Jacob Jan Paulus 

Publication date: 2 August 2013

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-012-9463-1

Recommendations

• Improved lower bound for online strip packing
• A new lower bound for online strip packing
• New upper bounds for online strip packing
• A note on online strip packing
• Approximate strip packing: revisited

zbMATH Keywords

strip packingcompetitive ratioonline algorithm

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Lower bounds for on-line two-dimensional packing algorithms
• Orthogonal Packings in Two Dimensions
• Aggressive online deadline scheduling
• A note on online strip packing
• Improved lower bound for online strip packing
• Online Algorithm for Parallel Job Scheduling and Strip Packing
• Scheduling parallel jobs to minimize the makespan
• Online scheduling of parallel jobs on two machines is 2-competitive
• Online matching on a line

Cited In (5)

• The generalization of scheduling with machine cost
• New upper bounds for online strip packing
• A new upper bound for the online square packing problem in a strip
• A new lower bound for online strip packing
• Improved lower bound for online strip packing

This page was built for publication: A tight analysis of Brown-Baker-Katseff sequences for online strip packing

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