Increasing the Weight of Minimum Spanning Trees

Journal of Algorithms

Volumn 33, Issue 2, 1999, Pages 244-266

  Frederickson, Greg N ^a   Solis Oba, Roberto ^a  

^a Purdue University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0004734410     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1999.1026     Document Type: Article

References (28)

1. K. R. Baker, "Introduction to Sequencing and Scheduling," Wiley, New York, 1974.
2. M. O. Ball, B. L. Golden, and R. V. Vohra, Finding the most vital arcs in a network, Oper. Res. Lett. 8 (1989), 73-76.
3. E. Cheng and W. H. Cunningham, A faster algorithm for computing the strength of a network, Inform. Process. Lett. 49 (1994), 209-212.
4. W. H. Cunningham, Optimal attack and reinforcement of a network, J. Assoc. Comput. Mach. 32 (1985), 549-561.
5. E. Dalhaus, D. S. Johnson, C. H. Papadimitriou, P. Seymour, and M. Yannakakis, The complexity of the multiway cuts, SIAM J. Comput. 23 (1994), 864-894.
6. G. N. Frederickson and D. J. Guan, Preemptive ensemble motion planning on a tree, SIAM J. Comput. 21 (1992), 1130-1152.
7. G. N. Frederickson and R. Solis-Oba, Increasing the weight of minimum spanning trees, in "Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1996," pp. 539-546.
8. G. N. Frederickson and R. Solis-Oba, Algorithms for measuring perturbality in matroid optimization, Combinatorica 18 (1998), 503-518.
9. D. R. Fulkerson and G. C. Harding, Maximizing the minimum source-sink path subject to a budget constraint, Math. Programming 13 (1977), 116-118.
10. H. N. Gabow, A matroid approach to finding edge connectivity and packing arborescences, J. Comput. System Sci. 50 (1995), 259-273.
11. H. N. Gabow, Algorithms for graphic polymatroids and parametric s-sets, in "Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, 1995," pp. 88-97.
12. M. R. Garey and D. S. Johnson, "Computers and Intractability: A Guide to the Theory of NP-Completeness," Freeman, New York, 1979.
13. O. Goldschmidt and D. S. Hochbaum, Polynomial algorithm for the k-cut problem, Mathematics of Operations Research 19 (1994), 24-37.
14. R. L. Graham and P. Hell, On the history of the minimum spanning tree problem, Annals of the History of Computing 1 (1985), 43-57.
15. L. Hsu, R. Jan, Y. Lee, and C. Hung, Finding the most vital edge with respect to minimum spanning tree in weighted graphs, Information Processing Letters 39 (1991), 277-281.
16. L. Hsu, P. Wang, and C. Wu, Parallel algorithms for finding the most vital edge with respect to minimum spanning tree, Parallel Computing 18 (1992), 1143-1155.
17. F. K. Hwang, On Steiner minimal trees with rectilinear distance, SIAM J. Appl. Math. 30 (1976), 104-114.
18. K. Iwano and N. Katoh, Efficient algorithms for finding the most vital edge of a minimum spanning tree, Information Processing Letters 48 (1993), 211-213.
19. S. Khuller and U. Vishkin, Biconnectivity approximations and graph carvings, J. Assoc. Comput. Mach. 41 (1994), 214-235.
20. E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, and D. B. Shmoys (Eds.), "The Traveling Salesman Problem," Wiley, New York, 1985.
21. K. Lin and M. Chern, The most vital edges in the minimum spanning tree problem, Information Processing Letters 45 (1993), 25-31.
22. K. Malik, A. K. Mittal, and S. K. Gupta, The k most vital arcs in the shortest path problem, Operations Research Letters 8 (1989), 223-227.
23. C. A. Phillips, The network inhibition problem, in "Proceedings of the 25th Annual ACM Symposium on Theory of Computing, 1993," pp. 776-785.
24. H. Saran and V. V. Vazirani, Finding k-cuts within twice the optimal, SIAM Journal on Computing 24 (1995), 101-108.
25. M. Schwartz and T. E. Stern, Routing techniques used in computer communication networks, IEEE Transactions on Communications 28 (1980), 539-552.
26. D. R. Shier, Arc tolerances in shortest path and network flow problems, Networks 10 (1980), 277-291.
27. H. Takahashi and A. Matsuyama, An approximate solution for the Steiner problem in graphs, Math. J. 24 (1980), 573-577.
28. R. E. Tarjan, Sensitivity analysis of minimum spanning trees and shortest path trees, Information Processing Letters 14 (1982), 30-33.