Online bin packing with advice

DOI10.4230/LIPICS.STACS.2014.174MaRDI QIDQ2965482zbMATH OpenFDO

Authors Shahin Kamali, Kim S. Larsen, Joan Boyar, Alejandro Lopez-Ortiz

Publication date 3 March 2017

Full work available at URL https://doi.org/10.4230/LIPICS.STACS.2014.174

zbMATH Keywords

online algorithmsadvice complexitybin packing

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Combinatorial optimization (90C27)

Recommendations

• Online bin packing with advice
• Online bin packing with advice of small size
• Online bin packing with advice of small size
• Online algorithms with advice for bin packing and scheduling problems
• Online algorithms with advice for the dual bin packing problem

Cited in

(16)

• Online bin packing with advice of small size
• Online bin packing with advice
• scientific article; zbMATH DE number 910900 (Why is no real title available?)
• Online Multi-Coloring with Advice
• Online algorithms with advice for bin packing and scheduling problems
• Online bin packing with advice of small size
• Online multi-coloring with advice
• A technique to obtain hardness results for randomized online algorithms -- a survey
• A simple PTAS for the dual bin packing problem and advice complexity of its online version
• Online bin covering with advice
• Online bin covering with advice
• Online rules for container stacking
• On the advice complexity of one-dimensional online bin packing
• On the advice complexity of the \(k\)-server problem under sparse metrics
• The string guessing problem as a method to prove lower bounds on the advice complexity
• Optimal online edge coloring of planar graphs with advice

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

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