TY - JOUR
T1 - Geometric algorithms for the minimum cost assignment problem
AU - Tokuyama, Takeshi
AU - Nakano, Jun
PY - 1995/7
Y1 - 1995/7
N2 - We consider the minimum‐cost λ‐assignment problem, which is equivalent to the minimum‐weight one‐to‐many matching problem on a complete bipartite graph Γ = (A, B), where A and B have n and k nodes (n ⩾ k), respectively. Formulating the problem geometrically, we given an O(kn + k2.5n0.5 log1.5 n) time randomized algorithm, which is better than the existing O(kn2 + n2 log n) time algorithm if n > k log k.
AB - We consider the minimum‐cost λ‐assignment problem, which is equivalent to the minimum‐weight one‐to‐many matching problem on a complete bipartite graph Γ = (A, B), where A and B have n and k nodes (n ⩾ k), respectively. Formulating the problem geometrically, we given an O(kn + k2.5n0.5 log1.5 n) time randomized algorithm, which is better than the existing O(kn2 + n2 log n) time algorithm if n > k log k.
UR - http://www.scopus.com/inward/record.url?scp=84990712132&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84990712132&partnerID=8YFLogxK
U2 - 10.1002/rsa.3240060403
DO - 10.1002/rsa.3240060403
M3 - Article
AN - SCOPUS:84990712132
VL - 6
SP - 393
EP - 406
JO - Random Structures and Algorithms
JF - Random Structures and Algorithms
SN - 1042-9832
IS - 4
ER -