Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
1141801 | Discrete Optimization | 2006 | 11 Pages |
Abstract
Given an undirected network, the multi-terminal network flows analysis consists in determining the all pairs maximum flow values. In this paper, we consider an undirected network in which some edge capacities are allowed to vary and we analyze the impact of such variations on the all pairs maximum flow values. We first provide an efficient algorithm for the single parametric capacity case, and then propose a generalization to the case of multiple parametric capacities. Moreover, we provide a study on Gomory–Hu cut-tree relationships.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Control and Optimization
Authors
D. Barth, P. Berthomé, M. Diallo, A. Ferreira,