An approximation algorithm is presented for minimizing a nondecreasing supermodular set function, and its performance guarantee is probed.

摘给出一类上模集函数最小值问题的一近似算法，并讨论所给算法的性能保证。

A local search algorithm for minimizing a nondecreasing supermodular set function is presented,and its performance guarantee is probed.

给出一类具有简单约束的上模集函数最小值问题的一局部搜索法,并讨论所给算法的性能保证。