A strongly polynomial algorithm for the inverse shortest arborescence problem

Discrete Applied Mathematics

Volumn 82, Issue 1-3, 1998, Pages 135-154

  Hu, Zhiquan ^b   Liu, Zhenhong ^a  

^a INSTITUTE OF GEOLOGY AND GEOPHYSICS   (China)

^b CENTRAL CHINA NORMAL UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0001371906     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0166-218x(97)86750-9     Document Type: Article

References (6)

1. J.A. Bondy, U.S.R. Murty, Graph Theory with Applications, Macmillan press, London, 1976.
2. D. Burton, Ph.L. Toint, On an instance of the inverse shortest paths problem. Math. Programming 53 (1992) 45-61.
3. Y.J. Chu, T.H. Liu, On the shortest arborescence of a directed graph. Sci. Sinica 14 (1965) 1396-1400.
4. J. Edmonds, Optimum branchings, J. Res. Nat. Bur. Standards B 71 (1967) 233-240.
5. C.H. Papadimitriou, K. Steiglitz. Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall. Englewood Cliffs, NJ, 1982.
6. Shaoji Xu, Jianzhong Zhang, An inverse problem of the weighted shortest path problem, Rutgers University, New Brunswick, NJ, 1992, preprint.