Algorithms – ESA 2005

DOI10.1007/11561071zbMATH Open1142.68609OpenAlexW2501059503MaRDI QIDQ5475889FDOQ5475889

Marcin Bienkowski, Jaroslaw Byrka

Publication date: 27 June 2006

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

Full work available at URL: https://doi.org/10.1007/11561071

Recommendations

• The online set cover problem
• The online set cover problem
• A distributed algorithm for a set cover game
• STACS 2005
• A Tight Analysis of the Greedy Algorithm for Set Cover

Mathematics Subject Classification ID

Randomized algorithms (68W20) Analysis of algorithms (68W40) Approximation algorithms (68W25) Combinatorial games (91A46)

Cited In (1)

• Optimal algorithms for page migration in dynamic networks

This page was built for publication: Algorithms – ESA 2005

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