Computer Algorithm question
An award committeeâ€™s job is to award n prizes to m candidates. Each prize is associated with
a list of candidates who are qualified to receive the prize. There is however an upper bound k
on the number of prizes each candidate can receive. Design an efficient algorithm that given n
and m, the list of qualified candidates for each of the n prizes, and the upper bound k, awards
the n prizes to the m candidates so as to maximize the number of prizes awarded. Analyze the
running time and show the correctness of your algorithm.
Thanks for installing the Bottom of every post plugin by Corey Salzano. Contact me if you need custom WordPress plugins or website design.