Stochastic-lazier-greedy algorithm for monotone non-submodular maximization
From MaRDI portal
Publication:2666680
Recommendations
- Fast algorithms for maximizing monotone nonsubmodular functions
- Maximization of nonsubmodular functions under multiple constraints with applications
- Fast algorithms for maximizing monotone nonsubmodular functions
- Submodular maximization with cardinality constraints
- Approximation guarantees for parallelized maximization of monotone non-submodular function with a cardinality constraint
Cites work
- A threshold of ln n for approximating set cover
- Adaptive submodularity: theory and applications in active learning and stochastic optimization
- An analysis of approximations for maximizing submodular set functions—I
- Best Algorithms for Approximating the Maximum of a Submodular Set Function
- scientific article; zbMATH DE number 6474901 (Why is no real title available?)
- scientific article; zbMATH DE number 5968956 (Why is no real title available?)
- scientific article; zbMATH DE number 3580314 (Why is no real title available?)
- scientific article; zbMATH DE number 1906319 (Why is no real title available?)
- Near-optimal sensor placements in Gaussian processes: theory, efficient algorithms and empirical studies
Cited in
(2)
This page was built for publication: Stochastic-lazier-greedy algorithm for monotone non-submodular maximization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2666680)