Search found 2 matches

by teamacm
Sat Feb 24, 2007 7:33 am
Forum: ACM ICPC Archive Board
Topic: Problem 3277 : Workshops
Replies: 7
Views: 6785

Could you please tell me what kind of greedy algorithm would solve it?
by teamacm
Mon Feb 05, 2007 4:34 am
Forum: ACM ICPC Archive Board
Topic: Problem 3277 : Workshops
Replies: 7
Views: 6785

We solved it in contest by Graph matching.;) Do you mean weighted bipartite matching? I've been attempting to implement this using Ford-Fulkerson and a modified Dijkstra (to avoid the problem of negative weighted edges). However, it is too slow: O(v^3) where v=1000. Could you give details about how...

Go to advanced search