Online Bin Covering: Expectations vs. Guarantees

DOI10.1007/978-3-319-03780-6_20zbMath1338.68296OpenAlexW2951943490MaRDI QIDQ2867122

Marie G. Christ, Kim S. Larsen, Lene Monrad Favrholdt

Publication date: 10 December 2013

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-03780-6_20

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Online bin covering: expectations vs. guarantees
• A comparison of performance measures for online algorithms
• The relative worst-order ratio applied to paging
• Random-order bin packing
• 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
• Relative Interval Analysis of Paging Algorithms on Access Graphs
• A Comparison of Performance Measures via Online Search
• 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

This page was built for publication: Online Bin Covering: Expectations vs. Guarantees