Online bin packing with advice
From MaRDI portal
Publication:2965482
DOI10.4230/LIPICS.STACS.2014.174zbMATH Open1359.68322MaRDI QIDQ2965482FDOQ2965482
Authors: Shahin Kamali, Kim S. Larsen, Joan Boyar, Alejandro Lopez-Ortiz 
Publication date: 3 March 2017
Recommendations
Cited In (17)
- Online bin packing with advice of small size
- Title not available (Why is that?)
- Online bin packing with advice
- Online Multi-Coloring with Advice
- Online algorithms with advice for bin packing and scheduling problems
- On the list update problem with advice
- Online bin packing with advice of small size
- Online multi-coloring with advice
- A simple PTAS for the dual bin packing problem and advice complexity of its online version
- A technique to obtain hardness results for randomized online algorithms -- a survey
- 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
- Optimal online edge coloring of planar graphs with advice
- The string guessing problem as a method to prove lower bounds on the advice complexity
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)
