Abstract
The only known strongly polynomial algorithm for solving minimum cost submodular flow problems is due to Frank and Tardos (Frank, A., É. Tardos. 1985. An application of the simultaneous approximation in combinatorial optimization. Report No. 85375, Institut für Ökonometrie und Operations Research, Bonn, May.) and is based on the simultaneous approximation algorithm of Lenstra, Lenstra, and Lovász (Lenstra, A. K., H. W. Lenstra, L. Lovász. 1982. Factoring polynomials with rational coefficients. Math. Ann. 261 515–534.). We propose a purely combinatorial strongly polynomial algorithm. It consists in solving a sequence of at most m + n(n − 1) minimum cost submodular flow problems with cost coefficients bounded by n2, where n is the number of the vertices and m is the number of the arcs in the underlying graph. The current cost coefficients are calculated by means of tree projection and scaling.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
