On-line variable sized covering

DOI10.1007/3-540-44679-6_52MaRDI QIDQ4553241zbMATH OpenFDO

Authors Leah Epstein

Publication date 4 November 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44679-6_52

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Nonnumerical algorithms (68W05)

Recommendations

• Online variable sized covering
• On-line and off-line approximation algorithms for vector covering problems
• Optimal on-line algorithms for variable-sized bin covering
• scientific article; zbMATH DE number 2016848
• Lower bounds for online bin covering-type problems

Cited in

(8)

• Optimal on-line algorithms for variable-sized bin covering
• On-line and off-line approximation algorithms for vector covering problems
• Online variable sized covering
• Lower bounds for online bin covering-type problems
• scientific article; zbMATH DE number 6696496 (Why is no real title available?)
• Approximation algorithms for generalized and variable-sized bin covering
• scientific article; zbMATH DE number 2016848 (Why is no real title available?)
• On-line and off-line approximation algorithms for vector covering problems

This page was built for publication: On-line variable sized covering

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