Online variable sized covering

DOI10.1006/INCO.2001.3087zbMath1009.68200OpenAlexW2046642776MaRDI QIDQ1854485

Leah Epstein

Publication date: 14 January 2003

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.2001.3087

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Combinatorial optimization (90C27) Parallel algorithms in computer science (68W10) Randomized algorithms (68W20)

Related Items (3)

Online bin covering with limited migration ⋮ Online Bin Covering with Limited Migration ⋮ Lower bounds for online bin covering-type problems

Cites Work

• Unnamed Item
• Online algorithms. The state of the art
• Online algorithms for a dual version of bin packing
• Optimal on-line algorithms for variable-sized bin covering
• On-line and off-line approximation algorithms for vector covering problems
• On a dual version of the one-dimensional bin packing problem
• Probabilistic analysis of algorithms for dual bin packing problems

This page was built for publication: Online variable sized covering