𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A faster capacity scaling algorithm for minimum cost submodular flow

✍ Scribed by Lisa Fleischer; Satoru Iwata; S. Thomas McCormick

Publisher
Springer-Verlag
Year
2002
Tongue
English
Weight
217 KB
Volume
92
Category
Article
ISSN
0025-5610

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A capacity scaling algorithm for M-conve
A capacity scaling algorithm for M-convex submodular flow
✍ Satoru Iwata; Satoko Moriguchi; Kazuo Murota πŸ“‚ Article πŸ“… 2004 πŸ› Springer-Verlag 🌐 English βš– 229 KB

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 algor

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 capacity scaling algorithm for the con
A capacity scaling algorithm for the constrained maximum flow problem
✍ Ravindra K. Ahuja; James B. Orlin πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 970 KB

## Abstract The constrained maximum flow problem is to send the maximum possible flow from a source node s to a sink node t in a directed network subject to a budget constraint that the cost of flow is no more than __D__. In this paper, we consider two versions of this problem: (i) when the cost of