Consistent Submodular Maximization with Full Foresight
cs.DS, cs.LG
Submitted: 2026-11-04
Updated: 2026-11-04
Code: https://github.com/epfl-thl2/project-consistent-submodular-full-foresight
Terminology
Sources
- Chasing Submodular Objectives, and Submodular Maximization via Cutting Planes
- A General Framework for Dynamic Consistent Submodular Maximization
- A Sharp Barrier of Consistent Submodular Maximization: Any Improvement over 2-sqrt 2 Entails Exponential Queries or Linear Recourse
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