Summary and Info
This paper presents a faster algorithm for the M-convex submodular How problem, which is a generalization of the minimum-cost How problem with an M-convex cost function for the How-boundary, where an M-convex function is a nonlinear nonseparable cliserete convex function on integer points. The algorithm extends the capacity sealing approach lor the submodular How problem by Fleischer. Iwata and MeCormiek (2002) with the aid of a novel technique of changing the potential by solving maximum submodular How problems.
More About the Author
Satoru Iwata (Japanese: 岩田 聡, Hepburn: Iwata Satoru, December 6, 1959 – July 11, 2015) was a Japanese video game programmer and businessman who served as the fourth president and chief executive officer (CEO) of Nintendo.
Review and Comments
Rate the Book
A capacity scaling algorithm for M-convex submodular flow 0 out of 5 stars based on 0 ratings.