Online variable sized covering

DOI10.1006/INCO.2001.3087zbMATH Open1009.68200OpenAlexW2046642776MaRDI QIDQ1854485FDOQ1854485

Authors: 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

Recommendations

• scientific article; zbMATH DE number 1798171
• On-line machine covering
• On-line machine covering
• The online set cover problem
• The online set cover problem
• Variable-Size Rectangle Covering
• On-line vertex-covering
• Optimal on-line algorithms for variable-sized bin covering
• Online maximum \(k\)-coverage
• Online maximum \(k\)-coverage

Mathematics Subject Classification ID

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

Cites Work

• On a dual version of the one-dimensional bin packing problem
• Title not available (Why is that?)
• Online algorithms. The state of the art
• On-line and off-line approximation algorithms for vector covering problems
• Online algorithms for a dual version of bin packing
• Optimal on-line algorithms for variable-sized bin covering
• Probabilistic analysis of algorithms for dual bin packing problems

Cited In (9)

• Tighter bounds for the harmonic bin packing algorithm
• Title not available (Why is that?)
• Online Bin Covering with Limited Migration
• On-line and off-line approximation algorithms for vector covering problems
• Title not available (Why is that?)
• Lower bounds for online bin covering-type problems
• Online bin covering with limited migration
• Title not available (Why is that?)
• Approximation algorithms for generalized and variable-sized bin covering

This page was built for publication: Online variable sized covering

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1854485)