Publisher
Springer International Publishing
Reference29 articles.
1. Baum, S., Trotter Jr., L.E.: Integer rounding for polymatroid and branching optimization problems. SIAM J. Algebraic Discrete Methods 2, 416–425 (1981)
2. Bock, F.: An algorithm to construct a minimum directed spanning tree in a directed network. In: Developments in Operations Research, pp. 29–44. Gordon and Breach (1971)
3. Bouchet, A.: Greedy algorithm and symmetric matroids. Math. Program. 38, 147–159 (1987)
4. Chandrasekaran, R., Kabadi, S.N.: Pseudomatroids. Discrete Math. 71, 205–217 (1988)
5. Chu, Y.J., Liu, T.H.: On the shortest arborescence of a directed graph. Sci. Sinica 14, 1396–1400 (1965)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献