论文信息 - A Polynomial Time Algorithm for Minimizing a Nondecreasing Supermodular Set Function and Its Performance Guarantee

A Polynomial Time Algorithm for Minimizing a Nondecreasing Supermodular Set Function and Its Performance Guarantee

This paper presents a polynomial algorithm for minimizing a nondecreasing supermodular set function and discusses its performance guarantee. AMS Subject Classification: 05C15

Xiaoli Zhe | Fangfang Zhang | Wumin Wang | Shanglu He

[1] 藤重悟. Submodular functions and optimization , 1991 .

[2] Victor P. Il'ev,et al. An Approximation Guarantee of the Greedy Descent Algorithm for Minimizing a Supermodular Set Function , 2001, Discret. Appl. Math..

[3] Victor P. Il'ev,et al. Performance guarantees of a greedy algorithm for minimizing a supermodular set function on comatroid , 2006, Eur. J. Oper. Res..