论文信息 - On submodular function minimization

On submodular function minimization

Earlier work of Bixby, Cunningham, and Topkis is extended to give a combinatorial algorithm for the problem of minimizing a submodular function, for which the amount of work is bounded by a polynomial in the size of the underlying set and the largest function value (not its length).

William H. Cunningham

[1] William H. Cunningham,et al. Decomposition of submodular functions , 1983, Comb..

[2] William H. Cunningham,et al. Testing membership in matroid polyhedra , 1984, J. Comb. Theory, Ser. B.

[3] W. Cunningham. Decomposition of Directed Graphs , 1982 .

[4] William H. Cunningham,et al. Minimum cuts, modular functions, and matroid polyhedra , 1985, Networks.

[5] Martin Grötschel,et al. The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..

[6] László Lovász,et al. Submodular functions and convexity , 1982, ISMP.