A polynomial cycle canceling algorithm for submodular flows |
| |
Authors: | C Wallacher Uwe T Zimmermann |
| |
Institution: | (1) SAP AG, Neurottstrasse 16, D-69190 Walldorf, Germany, DE;(2) TU Braunschweig, Abteilung für Mathematische Optimierung, Pockelsstrasse 14, D-38106 Braunschweig, Germany, e-mail: U.Zimmermann@tu-bs.de, DE |
| |
Abstract: | Submodular flow problems, introduced by Edmonds and Giles 2], generalize network flow problems. Many algorithms for solving
network flow problems have been generalized to submodular flow problems (cf. references in Fujishige 4]), e.g. the cycle
canceling method of Klein 9]. For network flow problems, the choice of minimum-mean cycles in Goldberg and Tarjan 6], and
the choice of minimum-ratio cycles in Wallacher 12] lead to polynomial cycle canceling methods. For submodular flow problems,
Cui and Fujishige 1] show finiteness for the minimum-mean cycle method while Zimmermann 16] develops a pseudo-polynomial
minimum ratio cycle method. Here, we prove pseudo-polynomiality of a larger class of the minimum-ratio variants and, by combining
both methods, we develop a polynomial cycle canceling algorithm for submodular flow problems.
Received July 22, 1994 / Revised version received July 18, 1997? Published online May 28, 1999 |
| |
Keywords: | : submodular flow problem – cycle canceling method – polynomial algorithms |
本文献已被 SpringerLink 等数据库收录! |
|