Greedy algorithm for maximization of semi-monotone non-submodular functions with applications
From MaRDI portal
Cites work
- A 1/2-approximation algorithm for maximizing a non-monotone weak-submodular function on a bounded integer lattice
- A note on maximizing the spread of influence in social networks
- An R-square coefficient based on final prediction error
- An optimal streaming algorithm for non-submodular functions maximization on the integer lattice
- Greedy guarantees for minimum submodular cost submodular/non-submodular cover problem
- scientific article; zbMATH DE number 5968956 (Why is no real title available?)
- scientific article; zbMATH DE number 7255156 (Why is no real title available?)
- scientific article; zbMATH DE number 7788401 (Why is no real title available?)
- Locally Adaptive Optimization: Adaptive Seeding for Monotone Submodular Functions
- Maximizing a monotone submodular function subject to a matroid constraint
- Maximizing Non-monotone Submodular Functions
- Non-monotone submodular maximization under matroid and knapsack constraints
- Robust monotone submodular function maximization
- Streaming algorithm for maximizing a monotone non-submodular function under \(d\)-knapsack constraint
- Two approximation algorithms for maximizing nonnegative weakly monotonic set functions
- Weakly Submodular Function Maximization Using Local Submodularity Ratio.
- Welfare maximization and the supermodular degree
This page was built for publication: Greedy algorithm for maximization of semi-monotone non-submodular functions with applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6612543)
