A new ordered local search algorithm achieves k/2 + o(k) approximation for monotone submodular maximization over k matroids and (ln 4 k)/3 + o(k) for weighted k-set packing.
Nguyen , editor =
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
-
Submodular Maximization over Many Matroids via Ordered Local Search
A new ordered local search algorithm achieves k/2 + o(k) approximation for monotone submodular maximization over k matroids and (ln 4 k)/3 + o(k) for weighted k-set packing.