A Polynomial-time Algorithm for the Bottleneck Assignment Problem
DOI:
CSTR:
Author:
Affiliation:
Clc Number:
Fund Project:
Article
|
Figures
|
Metrics
|
Reference
|
Related
|
Cited by
|
Materials
|
Comments
Abstract:
In this paper, we give a new algorithm for the bottleneck assignment problem on the basis of Konig's theorem, and show that the time complexity of the algorithm is O(n3).
