๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A dual algorithm for submodular flow problems

โœ Scribed by Nam-kee Chung; Dong-wan Tcha

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
499 KB
Volume
10
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A cost-scaling algorithm for 0โ€“1 submodu
A cost-scaling algorithm for 0โ€“1 submodular flows
โœ Maiko Shigeno; Satoru Iwata ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 820 KB

This paper presents a cost-scaling algorithm for minimum cost O-l submodular flows. The algorithm works by splitting the arc costs approximately and maintaining an optimal submodular pseudoflow with respect to the split costs obtained by a greedy algorithm. Each scaling phase of the algorithm is a h

A Fully Combinatorial Algorithm for Subm
A Fully Combinatorial Algorithm for Submodular Function Minimization
โœ Satoru Iwata ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 115 KB

This paper presents a strongly polynomial algorithm for submodular function minimization using only additions, subtractions, comparisons, and oracle calls for function values.