The online set cover problem
From MaRDI portal
Publication:3581267
DOI10.1145/780542.780558zbMath1192.90154OpenAlexW2021185572MaRDI QIDQ3581267
Noga Alon, Baruch Awerbuch, Yossi Azar
Publication date: 16 August 2010
Published in: Proceedings of the thirty-fifth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/780542.780558
Analysis of algorithms (68W40) Combinatorial optimization (90C27) Online algorithms; streaming algorithms (68W27)
Related Items
Unnamed Item, Robust multicovers with budgeted uncertainty, Non-cooperative cost sharing games via subsidies, Viral marketing of online game by DS decomposition in social networks