The Online Submodular Cover Problem

DOI10.1137/1.9781611975994.94MaRDI QIDQ5146871zbMATH OpenOpenAlexFDO

Authors

Publication date 2 February 2021

Published in Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611975994.94

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(10)

• Approximating the online set multicover problems via randomized winnowing
• Online maximum k-interval coverage problem
• Online maximum \(k\)-coverage
• Online Submodular Maximization with Free Disposal
• scientific article; zbMATH DE number 7525448 (Why is no real title available?)
• Online Submodular Maximization Problem with Vector Packing Constraint.
• Dynamic \(((1+\epsilon)\ln n)\)-approximation algorithms for minimum set cover and dominating set
• Online multiset submodular cover
• Nonlinear paging
• Submodular combinatorial information measures with applications in machine learning

This page was built for publication: The Online Submodular Cover Problem

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