Parameterized Complexity of Team Formation in Social Networks
Theor. Comput. Sci., Volume 717, 2018, Pages 26-36.
Given a task that requires some skills and a social network of individuals with different skills, the Team Formation problem asks to find a team of individuals that together can perform the task, while minimizing communication costs. Since the problem is NP-hard, we identify the source of intractability by analyzing its parameterized comp...More
Full Text (Upload PDF)
PPT (Upload PPT)