Greedy is good: constrained non-submodular function maximization via weak submodularity
From MaRDI portal
Publication:6601966
DOI10.1007/s40305-022-00444-2MaRDI QIDQ6601966
Publication date: 11 September 2024
Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)
greedy algorithm\(p\)-systemnon-submodular function\(p\)-extendible system\(p\)-matroid intersection
Related Items (2)
Fast deterministic algorithms for non-submodular maximization with strong performance guarantees ⋮ Weak submodularity implies localizability: local search for constrained non-submodular function maximization
Cites Work
- Unnamed Item
- 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
- Parametric monotone function maximization with matroid constraints
- Maximize a monotone function with a generic submodularity ratio
- Non-submodular maximization on massive data streams
- Submodular functions and optimization.
- Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
- An analysis of approximations for maximizing submodular set functions—I
- Optimal Approximation for Submodular and Supermodular Optimization with Bounded Curvature
- Non-Submodular Maximization with 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 is good: constrained non-submodular function maximization via weak submodularity
