Optimal on-line algorithms for variable-sized bin covering
From MaRDI portal
Publication:1306350
DOI10.1016/S0167-6377(99)00023-1zbMath0941.90073WikidataQ127725617 ScholiaQ127725617MaRDI QIDQ1306350
Gerhard J. Woeginger, Guo-Chuan Zhang
Publication date: 19 December 1999
Published in: Operations Research Letters (Search for Journal in Brave)
approximation algorithmcompetitive analysison-line algorithmcovering problemasymptotic worst-case ratio
Related Items
Packing items to feed assembly lines, Online bin covering with limited migration, Selfish bin covering, On the on-line rent-or-buy problem in probabilistic environments, An on-line bin-batching problem., Bin packing with controllable item sizes, Online Bin Covering with Limited Migration, Lower bounds for online bin covering-type problems, Online LIB problems: Heuristics for Bin Covering and lower bounds for Bin Packing, Online variable sized covering
Cites Work
- Unnamed Item
- Online algorithms for a dual version of bin packing
- On a dual version of the one-dimensional bin packing problem
- Probabilistic analysis of algorithms for dual bin packing problems
- A simple on-line bin-packing algorithm
- On-line and off-line approximation algorithms for vector covering problems
