A capacity scaling algorithm for convex cost submodular flows
Conference
·
OSTI ID:416833
- Kyoto Univ. (Japan)
This paper presents a scaling scheme for submodular functions. A small but strictly submodular function is added before scaling so that the resulting functions should be submodular. This scaling scheme leads to a weakly polynomial algorithm to solve minimum cost integral submodular flow problems with separable convex cost functions, provided that an oracle for exchange capacities are available.
- OSTI ID:
- 416833
- Report Number(s):
- CONF-960121--
- Country of Publication:
- United States
- Language:
- English
Similar Records
Is submodularity testable?
Why doesn`t min mean cancelling work for submodular flow
A fully polynomial approximations cutting plane algorithm for integer programs represented by a separation oracle and related results
Conference
·
Fri Oct 01 00:00:00 EDT 2010
·
OSTI ID:1030309
Why doesn`t min mean cancelling work for submodular flow
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:36274
A fully polynomial approximations cutting plane algorithm for integer programs represented by a separation oracle and related results
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:35857