Algebraic methods applied to shortest path and maximum flow problems in stochastic networks
We present an algebraic approach for computing the distribution of the length of a shortest s ‐ t path, as well as the distribution of the capacity of a minimum s ‐ t cut, in a network where the arc values (lengths and capacities) have known (discrete) probability distributions. For each problem, bo...
Saved in:
Published in | Networks Vol. 61; no. 2; pp. 117 - 127 |
---|---|
Main Authors | , |
Format | Journal Article Conference Proceeding |
Language | English |
Published |
Hoboken
Wiley Subscription Services, Inc., A Wiley Company
01.03.2013
Wiley Wiley Subscription Services, Inc |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | We present an algebraic approach for computing the distribution of the length of a shortest s ‐ t path, as well as the distribution of the capacity of a minimum s ‐ t cut, in a network where the arc values (lengths and capacities) have known (discrete) probability distributions. For each problem, both exact and approximating algorithms are presented. These approximating algorithms are shown to yield upper and lower bounds on the distribution of interest. This approach likewise provides exact and bounding distributions on the maximum flow value in stochastic networks. We also obtain bounds on the expected shortest path length as well as the expected minimum cut capacity (and the expected maximum flow value). © 2012 Wiley Periodicals, Inc. NETWORKS, 2013 |
---|---|
Bibliography: | ArticleID:NET21485 istex:685D7DE37C0C8A810FF2740BD79668B72721E982 ark:/67375/WNG-MDQG400C-H ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
ISSN: | 0028-3045 1097-0037 |
DOI: | 10.1002/net.21485 |