Article ID: | iaor1988757 |

Country: | United States |

Volume: | 14 |

Issue: | 1 |

Start Page Number: | 60 |

End Page Number: | 69 |

Publication Date: | Feb 1989 |

Journal: | Mathematics of Operations Research |

Authors: | Fujishige Satoru, Rock Hans, Zimmermann Uwe |

Abstract:

The only known strongly polynomial algorithm for solving minimum cost submodular flow problems is due to Frank and Tardos and is based on the simultaneous approximation algorithm of Lenstra, Lenstra, and Lovász. The authors propose a purely combinatorial strongly polynomial algorithm. It consists in solving a sequence of at most ^{2}, where