TY - GEN
T1 - Geometric algorithms for a minimum cost assignment problem
AU - Tokuyama, Takeshi
AU - Nakano, Jun
PY - 1991/6/1
Y1 - 1991/6/1
N2 - We consider the minimum cost A-assignment problem, which is equivalent to the minimum weight one-to-many matching problem in a complete bipartite graph Γ = (A,B), where A and B have n and k nodes respectively. Formulating the problem as a geometric problem, we give an O(kn + k3.5n0.5)-time randomized algorithm, which is better than existing O(kn2 + n2 log n)-time algorithm if k≤ n0.6.
AB - We consider the minimum cost A-assignment problem, which is equivalent to the minimum weight one-to-many matching problem in a complete bipartite graph Γ = (A,B), where A and B have n and k nodes respectively. Formulating the problem as a geometric problem, we give an O(kn + k3.5n0.5)-time randomized algorithm, which is better than existing O(kn2 + n2 log n)-time algorithm if k≤ n0.6.
UR - http://www.scopus.com/inward/record.url?scp=77953307102&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=77953307102&partnerID=8YFLogxK
U2 - 10.1145/109648.109678
DO - 10.1145/109648.109678
M3 - Conference contribution
AN - SCOPUS:77953307102
SN - 0897914260
T3 - Proceedings of the Annual Symposium on Computational Geometry
SP - 262
EP - 271
BT - Proceedings of the Annual Symposium on Computational Geometry
PB - Association for Computing Machinery
T2 - 7th Annual Symposium on Computational Geometry, SCG 1991
Y2 - 10 June 1991 through 12 June 1991
ER -