Arborescence optimization problems solvable by Edmonds' algorithm
暂无分享,去创建一个
[1] Richard M. Karp,et al. A simple derivation of Edmonds' algorithm for optimum branchings , 1971, Networks.
[2] Pierre A. Humblet. A Distributed Algorithm for Minimum Weight Directed Spanning Trees , 1983, IEEE Trans. Commun..
[3] Robert E. Tarjan,et al. Finding optimum branchings , 1977, Networks.
[4] João L. Sobrinho. Algebra and algorithms for QoS path computation and hop-by-hop routing in the internet , 2002, TNET.
[5] Robert E. Tarjan,et al. Efficient algorithms for finding minimum spanning trees in undirected and directed graphs , 1986, Comb..
[6] Francesco Maffioli,et al. A note on finding optimum branchings , 1979, Networks.
[7] Paolo M. Camerini. The Min-Max Spanning Tree Problem and Some Extensions , 1978, Inf. Process. Lett..
[8] Robert E. Tarjan,et al. Algorithms for Two Bottleneck Optimization Problems , 1988, J. Algorithms.