2EW Dijkstra, A note on two problems in connection with graphs, Numerische mathematic [J].1959,(1) :269-271.
3H Booth, J Westbrook, A linear algorithm for analysis of minimum spanning and shortest-path trees of planar graphs, Algorithmica[J]. 1994(4): 341-352.
4S Khuller, B Raghavachari, N Young, Balancing minimum spanning trees and shortest- path trees, Algorithmica [J]. 1995, (4) :305-321.
5D Eppstein, Shortest path along an MST, Computational Theory[J]. 1999.
6F. J. Vasko, etc. The cable trench problem: combining the shortest path and minimum spanning tree problems, Computers & Operations Research [J], 2002, (5) :441-458.
7LINGO, LINGO User's Guide[M], LINDO Systems inc. , 1995 : 37-39.
