A Sharp Barrier for Consistent Submodular Maximization: Any Improvement over 2-sqrt 2 Entails Exponential Queries or Linear Recourse
cs.DS, cs.LG
Submitted: 2026-09-09
Updated: 2026-09-09
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Terminology
Related papers
- Cascaded Learned Bloom Filter for Optimizing Model-Filter Size Balance and Fast Rejection
- Edge-Private Matching Kernels Through Local Decoding
- Local Node Differential Privacy
- Cheaper by the Batch: Shared Traversal for Genotype Graph Editing
- Scalable Algorithms for Approximate DNF Model Counting
- On the Approximation Relationship between Optimizing Ratio of Submodular (RS) and Difference of Submodular (DS) Functions