The linear assignment problem
Date
1992
Authors
Editor(s)
Advisor
Supervisor
Co-Advisor
Co-Supervisor
Instructor
Source Title
Print ISSN
Electronic ISSN
Publisher
Springer
Volume
82
Issue
Pages
85 - 122
Language
English
Type
Journal Title
Journal ISSN
Volume Title
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.
Course
Other identifiers
Book Title
Combinatorial optimization: new frontiers in theory and practice