Optimal Polynomial-Query Approximation for Consistent Submodular Maximization with Short Lookahead
cs.DS, cs.LG, math.OC
Submitted: 2026-11-08
Updated: 2026-11-08
Terminology
Sources
- Consistent Submodular Maximization with Full Foresight
- A Sharp Barrier of Consistent Submodular Maximization: Any Improvement over 2-sqrt 2 Entails Exponential Queries or Linear Recourse
- Symmetry and approximability of submodular maximization problems
Related papers
- Exploiting Low Scanwidth to Resolve Soft Polytomies
- PHastR: Faster Minimal Perfect Hashing with Rotated Layouts
- Fine-Grained Complexity of Approximating Vector Knapsack: A Faster Algorithm and Equivalence with k-SUM in 2D
- Polynomial-time computation of p-contraction fixed points for even p
- Separations Between Submodular-Like Graph Widths
- Bounded Integer Programming in Almost N 2d Time