9- https://doi.org/10.1007/978-3-030-27195-4_23
Maximize a Monotone Function with a Generic Submodularity Ratio
- Jan 1, 2019
- Qingqin Nong +5 more
Abstract
Generic submodularity ratio \(\gamma \) is a general measurement to characterize how close a nonnegative monotone set function is to be submodular. In this paper, we make a systematic analysis of greedy algorithms for maximizing a monotone and normalized set function with a generic submodularity ratio \(\gamma \) under Cardinality constraints, Knapsack constraints, Matroid constraints and K-intersection constraints.
- # Knapsack Constraints
- # Matroid Constraints
- # Cardinality Constraints
- # Set Function
- # Nonnegative Function
- # Monotone Set Function
- # Submodularity Ratio
- # Nonnegative Monotone
- # Monotone Set
- # Greedy Algorithms
