New random-order semi-streaming algorithms improve approximation guarantees over adversarial-order results for submodular maximization under matroids and related constraints, with an exponential reduction in passes needed for near-optimal matroid results.
SIAM Journal on Computing , volume=
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.DS 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
A Poisson process yields the tight (1-1/e) approximation for monotone submodular maximization subject to a matroid constraint without discretization or rounding.
citing papers explorer
-
Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order
New random-order semi-streaming algorithms improve approximation guarantees over adversarial-order results for submodular maximization under matroids and related constraints, with an exponential reduction in passes needed for near-optimal matroid results.
-
A Poisson Process for Submodular Maximization
A Poisson process yields the tight (1-1/e) approximation for monotone submodular maximization subject to a matroid constraint without discretization or rounding.