拟阵约束下非负非减下模函数最大值问题的近似算法及其性能保证

The Greedy Algorithm and Its Performance Guarantees for Maximizing Nonne-ativeand Non-decreasing Submodular Function Subject to a Partition Matroid Constraint

下模函数的最值问题在组合优化问题中有着广泛的应用,给出了具有剥分拟阵约束下非负非减下模函数最大值问题的近似算法,并讨论了所给算法的性能保证.

Maximizing or minimizing submodular function has widely used in combinatorial optimization problem,in this paper,we present an approximation algorithm for the greedy algorithm of maximizing non-negative and non-decreasing submodular function subject to a partition matroid constraint,and discuss its performance guarantee.