Browsing by Keywords "Short path problem"
Now showing items 1-1 of 1
(Springer, 1992)We present a broad survey of recent polynomial algorithms for the linear assignment problem. They all use essentially alternating trees and/or strongly feasible trees. Most of them employ Dijkstra’s shortest path algorithm ...