Adaptive scaling algorithm achieves 1.373 competitive ratio for incremental submodular maximization, improving on greedy's 1.582 with a 1.25 lower bound.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Incremental Submodular Maximization: Better Than Greedy
Adaptive scaling algorithm achieves 1.373 competitive ratio for incremental submodular maximization, improving on greedy's 1.582 with a 1.25 lower bound.