Geometry-Dependent Approximation for Non-Monotone k-Submodular Maximization
cs.DS, cs.LG, math.OC
Submitted: 2026-10-02
Updated: 2026-10-02
Sources
- Geometry-Dependent Bounds for Online Non-Monotone DR-Submodular Maximization
- Constrained Submodular Maximization via New Bounds for DR-Submodular Functions
- Upper-Linearizability of Online Non-Monotone DR-Submodular Maximization over Down-Closed Convex Sets
- Stochastic $k$-Submodular Bandits with Full Bandit Feedback
- A 1/2-Approximation for Budgeted $k$-Submodular Maximization
Related papers
- Cascaded Learned Bloom Filter for Optimizing Model-Filter Size Balance and Fast Rejection
- Computational and Statistical Hardness of Calibration Distance
- Edge-Private Matching Kernels Through Local Decoding
- Tight Bounds for Equivalence Testing with Non-Adaptive Conditional Samples
- Local Node Differential Privacy
- Cheaper by the Batch: Shared Traversal for Genotype Graph Editing