Online bin covering: expectations vs. guarantees
From MaRDI portal
Publication:300236
DOI10.1016/J.TCS.2014.06.029zbMath1338.68297arXiv1309.6477OpenAlexW2129253870MaRDI QIDQ300236
Marie G. Christ, Kim S. Larsen, Lene Monrad Favrholdt
Publication date: 27 June 2016
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1309.6477
Related Items (7)
Relative Worst-Order Analysis: A Survey ⋮ Online bin covering with limited migration ⋮ Best fit bin packing with random order revisited ⋮ Online Bin Covering with Limited Migration ⋮ Lower bounds for online bin covering-type problems ⋮ Best Fit Bin Packing with Random Order Revisited ⋮ Online Bin Covering: Expectations vs. Guarantees
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A comparison of performance measures for online algorithms
- The relative worst-order ratio applied to paging
- Random-order bin packing
- Online algorithms. The state of the art
- Competitive snoopy caching
- Online algorithms for a dual version of bin packing
- A new measure for the study of on-line algorithms
- List factoring and relative worst order analysis
- Comparing online algorithms for bin packing problems
- A comparison of performance measures via online search
- Relative Interval Analysis of Paging Algorithms on Access Graphs
- Access Graphs Results for LRU versus FIFO under Relative Worst Order Analysis
- The relative worst order ratio for online algorithms
- On a dual version of the one-dimensional bin packing problem
- Probabilistic analysis of algorithms for dual bin packing problems
- On the online bin packing problem
- A simple on-line bin-packing algorithm
- Improved Space for Bounded-Space, On-Line Bin-Packing
- On-line bin packing in linear time
- Probability
This page was built for publication: Online bin covering: expectations vs. guarantees
