Minimum spanning trees in networks with varying edge weights

Annals of Operations Research

Volumn 146, Issue 1, 2006, Pages 3-18

  Hutson, Kevin R ^a   Shier, Douglas R ^b  

^a FURMAN UNIVERSITY   (United States)

^b CLEMSON UNIVERSITY   (United States)

Author keywords

Cutsets; Networks; Reliability; Sensitivity analysis; Spanning trees; Stochastic networks

Indexed keywords

EID: 33747880806     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1007/s10479-006-0043-6     Document Type: Conference Paper

References (21)

1. Ahuja, R., T. Magnanti, and J. Orlin. (1993). Network Flows: Theory, Algorithms, and Applications. Englewood Cliffs, NJ: Prentice Hall Publishing.
2. Ahuja, R., T. Magnanti, J. Orlin, and M.R. Reddy. (1995). "Applications of Network Optimization." In M. O. Bail, T. L. Magnanti, C. L. Monma, and G. L. Nemhauser (eds.), Handbooks in Operations Research and Management Science, Amsterdam: Elsevier Science B.V., vol. 7, pp. 1-83.
3. Alexopoulos, C. (1997). "State Space Partitioning Methods for Stochastic Shortest Path Problems." Networks, 30, 9-21.
4. Alexopoulos, C. and J. Jacobson. (2000). "State Space Partition Algorithms for Stochastic Systems with Applications to Minimum Spanning Trees." Networks, 35, 118-138.
5. Bailey, M. P. (1994). "Solving a Class of Stochastic Minimization Problems." Operations Research, 42, 428-438.
6. Dixon, B., M. Rauch, and R. E. Tarjan. (1992). "Verification and Sensitivity Analysis of Minimum Spanning Trees in Linear Time." SIAM Journal on Computing, 6, 1184-1192.
7. Doulliez, P. and E. Jamoulle. (1972). "Transportation Networks with Random Arc Capacities." R.A.I.R.O., 3, 45-60.
8. Gabow, H. N. (1977). "Two Algorithms for Generating Weighted Spanning Trees in Order." SIAM Journal on Computing, 6, 139-150.
9. Gabow, H. N., Z. Galil, T. Spencer, and R. E. Tarjan. (1986). "Efficient Algorithms for Finding Minimum Spanning Trees in Undirected and Directed Graphs." Combinatorica, 2, 109-122.
10. Graham, R. L. and P. Hell. (1985). "On the History of the Minimum Spanning Tree Problem." Ann. History of Comp., 7, 43-57.
11. Gusfield, D. (1983). "A Note on Arc Tolerances in Sparse Shortest-Path and Network Flow Problems." Networks, 13, 191-196.
12. Hutson, K. (2002). "Stochastic Minimum Spanning Trees." Ph.D. Dissertation, Clemson University.
13. Jain, A. and J. W. Mamer. (1988). "Approximations for the Random Minimal Spanning Tree with Application to Network Provisioning." Operations Research, 36, 575-584.
14. Jarvis, J. and D. Shier. (1996). "An Improved Algorithm for Approximating the Performance of Stochastic Flow Networks." INFORMS Journal on Computing, 8, 355-360.
15. Kulkarni, V. G. (1986). "Minimum Spanning Trees in Undirected Networks with Exponentially Distributed Arc Weights." Networks, 16, 111-124.
16. Matsui, T. (1997). "A Flexible Algorithm for Generating All the Spanning Trees in Undirected Graphs." Algorithmica, 18, 530-543.
17. Shier, D. and C. Witzgall. (1980). "Arc Tolerances in Shortest Path and Network Flow Problems." Networks, 10, 277-291.
18. Tarjan, R. (1982). "Sensitivity Analysis of Minimum Spanning Trees and Shortest Path Trees." Inform. Process. Lett., 14, 30-33.
19. Tarjan, R. (1983). Data Structures and Network Algorithms. CBMS-NSF Regional Conference Series in Applied Mathematics 44. Philadelphia: SIAM Publishing.
20. Thulasiraman, K. (2004). "Graphs and Vector Spaces." In J. L. Gross and J. Yellen (eds.), Handbook of Graph Theory. Boca Raton: CRC Press, pp. 533-556.
21. Trotter, W. (1995). "Partially Ordered Sets." In R. Graham, M. Grotschel, and L. Lovasz (eds.), Handbook of Combinatorics. Amsterdam: Elsevier Science B.V., pp. 433-480.