Performance guarantees of a greedy algorithm for minimizing a supermodular set function on comatroid
暂无分享,去创建一个
[1] Gérard Cornuéjols,et al. Submodular set functions, matroids and the greedy algorithm: Tight worst-case bounds and some generalizations of the Rado-Edmonds theorem , 1984, Discret. Appl. Math..
[2] George L. Nemhauser,et al. Note--On "Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms" , 1979 .
[3] G. Nemhauser,et al. Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms , 1977 .
[4] Victor P. Il'ev,et al. An Approximation Guarantee of the Greedy Descent Algorithm for Minimizing a Supermodular Set Function , 2001, Discret. Appl. Math..
[5] Laurence A. Wolsey,et al. Integer and Combinatorial Optimization , 1988 .
[6] M. L. Fisher,et al. An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..