DocumentCode
1266319
Title
Efficient Role Transfer Based on Kuhn–Munkres Algorithm
Author
Haibin Zhu ; Mengchu Zhou
Author_Institution
Dept. of Comput. Sci. & Math., Nipissing Univ., North Bay, ON, Canada
Volume
42
Issue
2
fYear
2012
fDate
3/1/2012 12:00:00 AM
Firstpage
491
Lastpage
496
Abstract
Many-to-Many (M-M) role transfers are generalized problems that are encountered in collaboration. Exhaustive-search-based algorithms are too computationally intensive. This paper introduces the Kuhn-Munkres (or Hungarian) algorithm for the general assignment problems (GAPs) and proposes a new efficient algorithm to solve the M-M role transfer problems by converting them to the GAPs. The experiments and results validate the proposed algorithms.
Keywords
groupware; information systems; organisational aspects; search problems; Kuhn-Munkres algorithm; collaboration; exhaustive search based algorithms; general assignment problems; many-to-many role transfers; role transfer; Collaboration; Complexity theory; Heuristic algorithms; Humans; Minimization; Polynomials; Role transfer; Algorithm; emergency management; information systems; organization; role; role transfer;
fLanguage
English
Journal_Title
Systems, Man and Cybernetics, Part A: Systems and Humans, IEEE Transactions on
Publisher
ieee
ISSN
1083-4427
Type
jour
DOI
10.1109/TSMCA.2011.2159587
Filename
5942193
Link To Document