Gupta, Anupam; Krishnaswamy, Ravishankar; Kumar, Amit; Panigrahi, Debmalya Online and dynamic algorithms for set cover. (English) Zbl 1370.90217 Hatami, Hamed (ed.) et al., Proceedings of the 49th annual ACM SIGACT symposium on theory of computing, STOC ’17, Montreal, QC, Canada, June 19–23, 2017. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4528-6). 537-550 (2017). Cited in 3 ReviewsCited in 16 Documents MSC: 90C27 Combinatorial optimization 05C65 Hypergraphs 05C70 Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) 68W27 Online algorithms; streaming algorithms Keywords:set cover; competitive ratio; dynamic algorithms; graph matching; hypergraph matching; online algorithms; recourse; vertex cover PDFBibTeX XMLCite \textit{A. Gupta} et al., in: Proceedings of the 49th annual ACM SIGACT symposium on theory of computing, STOC '17, Montreal, QC, Canada, June 19--23, 2017. New York, NY: Association for Computing Machinery (ACM). 537--550 (2017; Zbl 1370.90217) Full Text: DOI arXiv