Algorithms for maximizing monotone submodular function minus modular function under noise
From MaRDI portal
Recommendations
- Fast algorithms for maximizing monotone nonsubmodular functions
- Fast algorithms for maximizing submodular functions
- Robust monotone submodular function maximization
- A new greedy strategy for maximizing monotone submodular function under a cardinality constraint
- Submodular Maximization Subject to a Knapsack Constraint Under Noise Models
Cites work
- A threshold of ln n for approximating set cover
- Approximate submodularity and its applications: subset selection, sparse approximation and dictionary selection
- Comments on bases in dependence structures
- Greedy -approximation algorithm for covering with arbitrary constraints and submodular cost
- scientific article; zbMATH DE number 1953186 (Why is no real title available?)
- On maximizing the difference between an approximately submodular function and a linear function subject to a matroid constraint
- On the power of membership queries in agnostic learning
- Optimization, approximation, and complexity classes
- Revealed Preference Theory
- Simultaneous approximation of multi-criteria submodular function maximization
- Streaming submodular maximization under differential privacy noise
- Submodular Approximation: Sampling-based Algorithms and Lower Bounds
- Submodular Function Minimization under Covering Constraints
- Submodular secretary problem and extensions
Cited in
(4)
This page was built for publication: Algorithms for maximizing monotone submodular function minus modular function under noise
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6046627)
