Akgül, MustafaAkgül, MustafaHamacher, H. W.Tüfekçi, S.2019-07-232019-07-2319929783642774911http://hdl.handle.net/11693/52282Conference Name: NATO Advanced Study Institute on New Frontiers in the Theory and Practice of Combinatorial OptimizationDate of Conference: 16-29 July 1990Chapter 5We 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 directly or indirectly. When properly implemented, each has the same complexity: O (n 3) for dense graphs with simple data structures and O (n 2 log n+nm) for sparse graphs using Fibonacci Heaps.EnglishSource nodeAssignment problemSink nodeShort path problemShort path algorithmConference Paper10.1007/978-3-642-77489-8_510.1007/978-3-642-77489-89783642774898