Greedy is good: constrained non-submodular function maximization via weak submodularity
From MaRDI portal
Publication:6601966
DOI10.1007/S40305-022-00444-2MaRDI QIDQ6601966FDOQ6601966
Publication date: 11 September 2024
Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)
Recommendations
- Greedy guarantees for non-submodular function maximization under independent system constraint with applications
- Maximization of constrained non-submodular functions
- Maximization of nonsubmodular functions under multiple constraints with applications
- Greedy algorithm for maximization of non-submodular functions subject to knapsack constraint
- Maximizing a monotone non-submodular function under a knapsack constraint
greedy algorithm\(p\)-systemnon-submodular function\(p\)-extendible system\(p\)-matroid intersection
Cites Work
- Title not available (Why is that?)
- Optimal Approximation for Submodular and Supermodular Optimization with Bounded Curvature
- Monotone submodular maximization over a matroid via non-oblivious local search
- Submodular functions and optimization.
- Maximizing a monotone submodular function subject to a matroid constraint
- An analysis of approximations for maximizing submodular set functions—I
- Near-optimal sensor placements in Gaussian processes: theory, efficient algorithms and empirical studies
- Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract)
- Optimal approximation for the submodular welfare problem in the value oracle model
- Design and analysis of approximation algorithms
- Title not available (Why is that?)
- Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem
- Maximize a monotone function with a generic submodularity ratio
- Non-submodular maximization with matroid and knapsack constraints
- Restricted strong convexity implies weak submodularity
- Parametric monotone function maximization with matroid constraints
- Non-submodular maximization on massive data streams
Cited In (4)
- Fast deterministic algorithms for non-submodular maximization with strong performance guarantees
- Unified greedy approximability beyond submodular maximization
- Maximize a monotone function with a generic submodularity ratio
- Weak submodularity implies localizability: local search for constrained non-submodular function maximization
This page was built for publication: Greedy is good: constrained non-submodular function maximization via weak submodularity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6601966)
