Search found 2 matches
Search found 2 matches • Page 1 of 1
- Thu May 19, 2011 4:27 am
- Forum: Algorithms
- Topic: Approximated assignment problem
- Replies: 3
- Views: 4883
The assignment problem can be exactly solved in cubic time by the Hungarian method (aka the Kuhn-Munkres algorithm), no need for approximation or brute force. There's implementations floating around all over the internet. (Even I wrote one --- http://www.cs.princeton.edu/~ken/hungarian_method.tar.gz...