A primal-dual Generalized Sequential algorithm achieves the first competitive ratio bound for online monotone DR-submodular maximization subject to linear packing constraints, matching the tight bound known for linear objectives.
Submodular se t functions, matroids and the greedy algorithm: tight worst-case bounds and some generalizatio ns of the rado-edmonds theorem
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Competitive Algorithms for Online Budget-Constrained Continuous DR-Submodular Problems
A primal-dual Generalized Sequential algorithm achieves the first competitive ratio bound for online monotone DR-submodular maximization subject to linear packing constraints, matching the tight bound known for linear objectives.