Algebraic methods for stochastic minimum cut and maximum flow problems

Authors:
Katherine C. Hastings;Douglas R. Shier
Affiliations:
Department of Mathematical Sciences, Clemson University, Clemson, SC;Department of Mathematical Sciences, Clemson University, Clemson, SC
Venue:
INOC'11 Proceedings of the 5th international conference on Network optimization
Year:
2011

Citing 4
Cited 1

The distribution of maximum flow with applications to multistate reliability systems

Operations Research
Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
State-space partition techniques for multiterminal flows in stochastic networks

Networks
Extended dominance and a stochastic shortest path problem

Computers and Operations Research

The value of information in stochastic maximum flow problems

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an algebraic approach for computing the distribution of the capacity of a minimum s-t cut in a network, in which the arc capacities have known (discrete) probability distributions. Algorithms are developed to determine the exact distribution as well as upper and lower bounding distributions on the capacity of a minimum cut. This approach then provides exact and bounding distributions on the maximum flow in such stochastic networks. We also obtain bounds on the expected capacity of a minimum cut (and the expected maximum flow value).