TY - GEN
T1 - Parameterized complexity of team formation in social networks
AU - Bredereck, Robert
AU - Chen, Jiehua
AU - Hüffner, Falk
AU - Kratsch, Stefan
N1 - Publisher Copyright:
© Springer International Publishing Switzerland 2016.
PY - 2016/1/1
Y1 - 2016/1/1
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84978198810&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-41168-2_12
DO - 10.1007/978-3-319-41168-2_12
M3 - Conference contribution
AN - SCOPUS:84978198810
SN - 9783319411675
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 137
EP - 149
BT - Algorithmic Aspects in Information and Management - 11th International Conference, AAIM 2016, Proceedings
A2 - Dondi, Riccardo
A2 - Mauri, Giancarlo
A2 - Fertin, Guillaume
PB - Springer Verlag
T2 - 11th International Conference on Algorithmic Aspects in Information and Management, AAIM 2016
Y2 - 18 July 2016 through 20 July 2016
ER -