MPS admit efficient Δ- and (1+λ_max)-approximations for additive maximization and (2+λ_max) / Δ^{2}(1-1/e-δ)^{-1} approximations for monotone submodular maximization, with Gap-ETH hardness ruling out min{Δ,λ_max}^{o(1)}.
Mathematical Programming , volume=
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Approximation Algorithms for Matroidal Prerequisite Systems
MPS admit efficient Δ- and (1+λ_max)-approximations for additive maximization and (2+λ_max) / Δ^{2}(1-1/e-δ)^{-1} approximations for monotone submodular maximization, with Gap-ETH hardness ruling out min{Δ,λ_max}^{o(1)}.