A curvature-triggered rewiring step added to sequential greedy yields better empirical coverage values while preserving the (1 - 1/e) worst-case guarantee for monotone submodular maximization under a cardinality constraint.
On bounds for greedy schemes in string optimization based on greedy curvatures,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.DM 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
ResQue Greedy: Rewiring Sequential Greedy for Improved Submodular Maximization
A curvature-triggered rewiring step added to sequential greedy yields better empirical coverage values while preserving the (1 - 1/e) worst-case guarantee for monotone submodular maximization under a cardinality constraint.