analysis and experimental study of an algorithm for automatic assignment of reviewers to papers
This paper is a continuation of the one entitled "An algorithm for automatic assignment of reviewers to papers" [1] published in CompSysTech 2006 Conference Proceedings. The main aim of the present paper is to outline the results of the analysis and experimental study of the suggested algorithm [1]. It has been compared in terms of accuracy and running time to the maximum-weighted matching algorithm of Kuhn and Munkres (also known as the Hungarian Algorithm) implemented in The MyReview System [3].
the assignment problem matching in bipartite graphs conference management system