A capacity scaling algorithm for convex cost submodular flows

Fecha:	1997
Resumen:	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 is available. .
Derechos:	Tots els drets reservats.
Lengua:	Anglès
Documento:	Article ; recerca ; Versió publicada
Materia:	Submodular flow ; Polynomial algorithm ; Convex optimization
Publicado en:	Mathematical Programming, vol. 76 n. 2 (1997) p. 299-308, ISSN 0025-5610

10 p, 451.8 KB

Acceso restringido a la UAB

Registro creado el 2006-03-13, última modificación el 2023-06-03