Online bin packing with advice of small size

DOI10.1007/978-3-319-21840-3_4zbMATH Open1435.68385OpenAlexW2223743052MaRDI QIDQ3449804FDOQ3449804

Authors Spyros Angelopoulos, Shahin Kamali, Marc P. Renault, Adi Rosén, Christoph Dürr 

Publication date 30 October 2015

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-21840-3_4

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27)

Recommendations

• Online bin packing with advice of small size
• Online bin packing with advice
• Online bin packing with advice
• Online algorithms with advice for bin packing and scheduling problems
• On the advice complexity of one-dimensional online bin packing

Cites work

• scientific article; zbMATH DE number 1232130 (Why is no real title available?)
• scientific article; zbMATH DE number 1870507 (Why is no real title available?)
• scientific article; zbMATH DE number 910900 (Why is no real title available?)
• Advice complexity and barely random algorithms
• Algorithms for the relaxed online bin-packing model
• Measuring the problem-relevant information in input
• New lower bounds for certain classes of bin packing algorithms
• On Bin Packing with Conflicts
• On online algorithms with advice for the \(k\)-server problem
• On the Advice Complexity of Online Problems
• On the advice complexity of the \(k\)-server problem
• On the online bin packing problem
• Online algorithms with advice for bin packing and scheduling problems
• Online bin packing with advice
• Online computation with advice
• Reordering buffer management with advice
• Repacking helps in bounded space on-line bin-packing
• The online knapsack problem: advice and randomization
• The string guessing problem as a method to prove lower bounds on the advice complexity
• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms

Cited in

(11)

• Parallel online algorithms for the bin packing problem
• On the advice complexity of the knapsack problem
• Online bin packing with advice of small size
• Online bin packing with advice
• Online algorithms with advice for bin packing and scheduling problems
• Online algorithms with advice for the dual bin packing problem
• Online bin packing with advice
• On the advice complexity of one-dimensional online bin packing
• Online bin covering with advice
• Online bin covering with advice
• A simple PTAS for the dual bin packing problem and advice complexity of its online version

This page was built for publication: Online bin packing with advice of small size

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