Arborescence optimization problems solvable by Edmonds' algorithm

Theoretical Computer Science

Volumn 301, Issue 1-3, 2003, Pages 427-437

  Georgiadis, Leonidas ^a  

^a ARISTOTLE UNIVERSITY OF THESSALONIKI   (Greece)

Author keywords

Bottleneck arborescence; Lexicographically optimal arborescence; Minimum arborescence; Minimum directed spanning tree; Widest minimum spanning tree

Indexed keywords

ALGORITHMS; OPTIMIZATION; PROBLEM SOLVING; TREES (MATHEMATICS);

OPTIMAL ARBORESCENCE;

COMPUTER SCIENCE;

EID: 0038371370     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00888-5     Document Type: Article

References (10)

1. Camerini P.M. The Min-Max spanning tree problem and some extensions. Inform. Process. Lett. 7(1):1978;10-14.
2. Camerini P.M., Fratta L., Maffioli F. A note on finding optimum branchings. Networks. 9:1979;309-312.
3. Chu Y.J., Liu T.H. On the shortest arborescence of a directed graph. Sci. Sinica. 14:1965;1396-1400.
4. Edmonds J. Optimum branchings. J. Res. Natl. Bureau Standards. 71B:1967;233-240.
5. Gabow H.N., Galil Z., Spencer T., Tarjan R.E. Efficient algorithms for finding minimum spanning trees in undirected and directed graphs. Combinatorica. 6(2):1986;109-122.
6. Gabow H.N., Tarjan R.E. Algorithms for two bottleneck optimization problems. J. Algorithms. 9:1988;411-417.
7. Humblet P.A. A distributed algorithm for minimum weight directed spanning trees. IEEE Trans. Comm. 31(6):1983;756-762.
8. Karp R.M. A simple derivation of Edmonds' algorithm for optimum branching. Networks. 1:1971;265-272.
9. J.L. Sobrino, Algebra and algorithms for QoS path computation and hop-by-hop routing in the internet, IEEE INFOCOM'01, Anchorage, Alaska, April 22-26, 2001.
10. Tarjan R.E. Finding optimum branchings. Networks. 7:1977;25-35.