Title
Parameterized complexity of team formation in social networks
Abstract
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 complexity with respect to parameters such as the total number of skills k, the team size l, the communication cost budget b, and the maximum vertex degree Δ. We show that the computational complexity strongly depends on the communication cost measure: when using the weight of a minimum spanning tree of the subgraph formed by the selected team, we obtain fixed-parameter tractability for example with respect to the parameter k. In contrast, when using the diameter as measure, the problem is intractable with respect to any single parameter; however, combining Δ with either b or l yields fixed-parameter tractability.
Year
DOI
Venue
2018
10.1016/j.tcs.2017.05.024
Theoretical Computer Science
Keywords
DocType
Volume
Computational complexity analysis,Parameterized complexity analysis,Team formation on social networks
Journal
717
ISSN
Citations 
PageRank 
0304-3975
0
0.34
References 
Authors
6
4
Name
Order
Citations
PageRank
Robert Bredereck128134.50
Jiehua Chen216520.55
Falk Hüffner380944.83
Stefan Kratsch456142.59