Online bin covering with advice
From MaRDI portal
Publication:5925507
DOI10.1007/s00453-020-00728-0OpenAlexW2942755285MaRDI QIDQ5925507
Kim S. Larsen, Lene Monrad Favrholdt, Shahin Kamali, Joan. Boyar
Publication date: 8 April 2021
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1905.00066
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Online bin packing with advice
- Online algorithms with advice for bin packing and scheduling problems
- Online algorithms with advice: the tape model
- The string guessing problem as a method to prove lower bounds on the advice complexity
- Online algorithms for a dual version of bin packing
- An asymptotic fully polynomial time approximation scheme for bin covering.
- Online algorithms with advice for the dual bin packing problem
- Online bin packing with advice of small size
- On the advice complexity of the \(k\)-server problem
- A Technique to Obtain Hardness Results for Randomized Online Algorithms – A Survey
- On a dual version of the one-dimensional bin packing problem
- Information Complexity of Online Problems
- A Logarithmic Additive Integrality Gap for Bin Packing
- Randomization Can Be as Helpful as a Glimpse of the Future in Online Computation
- A Simple PTAS for the Dual Bin Packing Problem and Advice Complexity of Its Online Version
- Lower bounds for several online variants of bin packing
- A new lower bound for classic online bin packing
