🏢 DataHeroes Israel
Practical $0.385$-Approximation for Submodular Maximization Subject to a Cardinality Constraint
·2921 words·14 mins·
loading
·
loading
AI Generated
AI Applications
Revenue Maximization
🏢 DataHeroes Israel
A novel algorithm achieves a 0.385-approximation for submodular maximization under cardinality constraints, combining strong theoretical guarantees with practical query complexity.