Search found 2 matches

by wrummler
Thu May 19, 2011 4:27 am
Forum: Algorithms
Topic: Approximated assignment problem
Replies: 3
Views: 4883

Re: Approximated assignment problem

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...
by wrummler
Mon Nov 29, 2010 11:12 pm
Forum: Volume 100 (10000-10099)
Topic: 10082 - WERTYU
Replies: 57
Views: 6905

Re: 10082 - WERTYU

Is anyone getting AC on UVa and PE on PC with this problem?

Code: Select all

Removed after taking it to heart that AC on one judge is good enough.

Go to advanced search