Abstract
An error in the proof, and in the statement of a generalization, of the result that submodular setfunctions can be minimized over the subsets with odd cardinality is corrected.
Similar content being viewed by others
References
M. Grötschel, L. Lovász andA. Schrijver, The ellipsoid method and its consequences in combinatorial optimization,Combinatorica 1 (1981), 169–197.
P. M. Jensen andB. Korte, Complexity of matroid property algorithms,SIAM J. Computing 11 (1982), 184–190.
M. W. Padberg andM. R. Rao, Odd minimum cut-sets andb-matchings,Math. Oper. Res. 7 (1982), 67–80.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Grötschel, M., Lovász, L. & Schrijver, A. Corrigendum to our paper “the ellipsoid method and its consequences in combinatorial optimization”. Combinatorica 4, 291–295 (1984). https://doi.org/10.1007/BF02579139
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02579139