Greedy guarantees for non-submodular function maximization under independent system constraint with applications
From MaRDI portal
Publication:2696953
DOI10.1007/s10957-022-02145-5OpenAlexW4311721852MaRDI QIDQ2696953
Zishen Yang, Majun Shi, Wei Wang
Publication date: 17 April 2023
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-022-02145-5
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Design and analysis of approximation algorithms
- Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem
- Restricted strong convexity implies weak submodularity
- Non-monotone submodular function maximization under \(k\)-system constraint
- Greedy algorithm for maximization of non-submodular functions subject to knapsack constraint
- Non-submodular maximization on massive data streams
- Determinantal Point Processes for Machine Learning
- Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints
- Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
- An analysis of approximations for maximizing submodular set functions—I
- An Analysis of the Greedy Heuristic for Independence Systems
- Cauchy's Interlace Theorem for Eigenvalues of Hermitian Matrices
- Optimal Approximation for Submodular and Supermodular Optimization with Bounded Curvature
- Non-Submodular Maximization with Matroid and Knapsack Constraints
- Non-monotone submodular maximization under matroid and knapsack constraints
- Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract)
- Monotone Submodular Maximization over a Matroid via Non-Oblivious Local Search
This page was built for publication: Greedy guarantees for non-submodular function maximization under independent system constraint with applications
