Greedy algorithms for on-line set-covering

zbMATH Open1277.90106MaRDI QIDQ2867360FDOQ2867360

Authors: Nicolas Bourgeois, Telis Giannakos, Vangelis Th. Paschos, Giorgio Ausiello 

Publication date: 11 December 2013

Published in: Algorithmic Operations Research (Search for Journal in Brave)

Full work available at URL: http://journals.hil.unb.ca/index.php/AOR/article/view/5928

Recommendations

• The online set cover problem
• The online set cover problem
• Online and dynamic algorithms for set cover
• scientific article; zbMATH DE number 1953086
• On the advice complexity of the set cover problem

zbMATH Keywords

approximation algorithmcompetitive ratioon-line algorithmapproximation ratioset-covering

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cited In (6)

• The online set cover problem
• Title not available (Why is that?)
• Efficient on-line algorithm for maintaining \(k\)-cover of sparse bit-strings
• Online maximum \(k\)-coverage
• On-line vertex-covering
• The online set cover problem

This page was built for publication: Greedy algorithms for on-line set-covering

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