Re: [转载] 最好的max-weighted bipartite match# CS - 计算机科学
c*r
1 楼
It is called the Hungarian method, O(n^3)
You may find it in any textbook for combinatorial optimization
You may find it in any textbook for combinatorial optimization
y*u
2 楼
实际中的code一般都加上一些heuristics,应该更快,n^3 是worst-case
【在 c****r 的大作中提到】
: It is called the Hungarian method, O(n^3)
: You may find it in any textbook for combinatorial optimization
【在 c****r 的大作中提到】
: It is called the Hungarian method, O(n^3)
: You may find it in any textbook for combinatorial optimization
相关阅读
请教 大牛 two majors in computer science & computer information systemHeuristic for 8 puzzlemachine learning toolkit packageHow to apply for the conference travel grant, any templatePattern Recognition Letters这个journal 怎么样？computer science and computer engineeringbroadnet这个会议如何？anyone get result from IPDPS?machine learning到底怎么归类呢a history questionKalman Filter, Neural Network, HMM 有什么区别呢What's the Chinese translation to tessellationMPI问题求助。Help! (转载)帮朋友忙 有些小活 50 dollars for each small projectPosition: Software Engineer, R有人用过Cavium Network的Evaluation Board (38xx)吗 (转载)请问哪里有introduction to complexity的习题解答？a'(a 上面一撇)英文怎么说?求电子书 Numerical Analysis by Richard L. Burden 多谢 (转载)Watch Google Technical Presentations Online