The linear assignment problem
Author(s)
Date
1992Publisher
Springer
Volume
82
Pages
85 - 122
Language
English
Type
Conference PaperItem Usage Stats
297
views
views
255
downloads
downloads
Book Title
Combinatorial optimization: new frontiers in theory and practice
Series
NATO ASI Series F: Computer and Systems Sciences; 82
Abstract
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 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.
Permalink
http://hdl.handle.net/11693/52282Published Version (Please cite this version)
https://doi.org/10.1007/978-3-642-77489-8_5https://doi.org/10.1007/978-3-642-77489-8