Abstract
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).
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
R. E. Bixby, W. H. Cunningham andD. M. Topkis, The poset of a polymatroid extreme point,Math. of Operations Res., to appear.
A. Bouchet,private communication, 1984.
W. H. Cunningham, Decomposition of directed graphs,SIAM J. Alg. and Disc. Methods 3 (1982), 214–228.
W. H. Cunningham, Decomposition of submodular functions,Combinatorica 3 (1983), 53–68.
W. H. Cunningham, Testing membership in matroid polyhedra,Journal of Combinatorial Theory (B) 36 (1984), 161–188.
W. H. Cunningham, Minimum cuts, modular functions, and matroid polyhedra,Networks, to appear.
J. Edmonds, Submodular functions, matroids, and certain polyhedra, in:Combinatorial Structures and their Applications (ed.: R. K. Guy et al.), Gordon and Breach, New York, 1970.
M. Grötschel, L. Lovász andA. Schrijver, The ellipsoid method and its consequences in combinatorial optimization,Combinatorica 1 (1981), 169–197.
L. Lovász, Submodular functions and convexity, in:Mathematical Programming: The State of the Art (ed: A. Bachem et al.), Springer-Verlag (1983), 235–257.
Author information
Authors and Affiliations
Additional information
Research partially supported by a grant from the Natural Sciences and Engineering Research Council of Canada.