Packing algorithms for arborescences (And spanning trees) in capacitated graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 920, Issue , 1995, Pages 388-402

  Gabow, Harold N ^a   Manu, K S ^a  

^a UNIVERSITY OF COLORADO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; DIRECTED GRAPHS;

EDGE CAPACITY; LAMINAR FAMILIES; PACKING ALGORITHMS; PACKING SPANNING TREES; POLYNOMIAL BOUNDS; SPANNING TREE;

INTEGER PROGRAMMING;

EID: 84949035941     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-59408-6_67     Document Type: Conference Paper

References (22)

1. J. Edmonds: Minimum partition of a matroid into independent subsets. J. Res. National Bureau of Standards 69B, 1965, pp. 67-72
2. J. Edmonds: Edge-disjoint branchings. In: Combinatorial Algorithms, R. Rustin, Ed., Algorithmics Press, New York, 1972, pp. 91-96
3. A. Frank: On disjoint trees and arborescences. In: Algebraic Methods in Graph Theory, L. Lovasz and V.T. Sos, Eds., Colloq. Math. Soc. Janos Bolyai 18, North-Holland, New York, 1978, pp. 159-169
4. A. Frank: Kernel systems of directed graphs. Acta Sd. Math. 41, 1979, pp. 63-76
5. H.N. Gabow: A matroid approach to finding edge connectivity and packing arborescences. Proc. 23rd Annual ACM Symp. on Theory of Comp., 1991, pp. 112-122; J. CSS, to appear
6. H.N. Gabow: Algorithms for graphic polymatroids and parametric s-sets. Proc. 6th Annual ACM-SIAM Symp. on Disc. Algorithms, 1995, pp. 88-97
7. M. Grötschel, L. Lovász, A. Schrijver: Geometric Algorithms and Combinatorial Optimization, Springer-Verlag, New York, 1988
8. H.N. Gabow, H.H. Westermann: Forests, frames and games: Algorithms for matroid sums and applications. Algorithmica 7, 1992, pp. 465-497
9. J. Hao, J.B. Orlin: A faster algorithm for finding the minimum cut in a directed graph. J. Algorithms 17, 3, 1994, pp. 424-446
10. H. Imai: Network-flow algorithms for lower-truncated transversal polymatroids. J. Op. Res. Soc. of Japan 26, 3, 1983, pp. 186-210
11. L. Lovasz: On two minimax theorems in graph theory. J. Comb. Theory, B, 21, 1976, pp. 96-103
12. W. Mader: On n-edge-connected digraphs. Annals Discr. Math. 17, 1983, pp. 439-441
13. C. Mao-cheng: Arc-disjoint arborescences of digraphs. J. Graph Theory 7, 1983, pp. 235-240
14. M.W. Padberg, L.A. Wolsey: Fractional covers for forests and matchings. Math. Programming 29, 1984, pp. 1-14
15. T. Radzik: Newton’s method for fractional combinatorial optimization. Proc. 33rd Annual Symp. on Found, of Comp. Sci., 1992, pp. 659-669
16. J. Roskind, R.E. Tarjan: A note on finding minimum-cost edge-disjoint spanning trees. Math. Op. Res. 10, 4, 1985, pp. 701-708
17. Y. Shiloach: Edge-disjoint branchings in directed multigraphs. Inf. Proc. Letters 8, 2, 1979, pp. 24-27
18. R.E. Tarjan: A good algorithm for edge-disjoint branching. Inf. Proc. Letters 3, 2, 1974, pp. 51-53
19. Trotter, Jr. L.E.: Discrete packing and covering. In: Combinatorial Optimization: Annotated Bibliographies, M. O’hEigeartaigh, J.K. Lenstra and A.H.G. Rinnooy Kan, Eds., John Wiley, New York, 1985, pp. 21-31
20. V.A. Trubin: Strength and reinforcement of a network and tree packing. Kiber- netika 2, 1991, pp. 67-75
21. V.A. Trubin: Strength of a graph and packing of trees and branchings. Kiber- netika i Sistemnyi Analiz 3, 1993, pp. 94-99
22. P. Tong, E.L. Lawler: A faster algorithm for finding edge-disjoint branchings. Inf. Proc. Letters 17, 2, 1983, pp. 73-76