Greedy algorithm for maximization of semi-monotone non-submodular functions with applications
From MaRDI portal
Publication:6612543
DOI10.1016/J.TCS.2024.114755MaRDI QIDQ6612543
Publication date: 1 October 2024
Published in: Theoretical Computer Science (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- An \(R\)-square coefficient based on final prediction error
- Robust monotone submodular function maximization
- A note on maximizing the spread of influence in social networks
- Greedy guarantees for minimum submodular cost submodular/non-submodular cover problem
- Two approximation algorithms for maximizing nonnegative weakly monotonic set functions
- A 1/2-approximation algorithm for maximizing a non-monotone weak-submodular function on a bounded integer lattice
- Streaming algorithm for maximizing a monotone non-submodular function under \(d\)-knapsack constraint
- An optimal streaming algorithm for non-submodular functions maximization on the integer lattice
- Welfare maximization and the supermodular degree
- Maximizing Non-monotone Submodular Functions
- Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
- Locally Adaptive Optimization: Adaptive Seeding for Monotone Submodular Functions
- Non-monotone submodular maximization under matroid and knapsack constraints
- Weakly Submodular Function Maximization Using Local Submodularity Ratio.
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)
