Generic submodularity ratio γ 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 γ under Cardinality constraints, Knapsack constraints, Matroid constraints and K-intersection constraints.

中文翻译：

---

具有通用子模数比的单调函数最大化

通用子模数比γ是表征非负单调集函数要接近多模数的一般度量。在本文中，我们对贪心算法进行了系统分析，以最大化在基数约束，背包约束，拟阵约束和K交叉约束下具有泛亚模数比γ的单调和归一化集合函数。