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.
arXiv preprint arXiv:2511.18263 , year=
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.DS 2years
2026 2representative 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.
- Above-Guarantee Algorithm for Properly Colored Trees