Parameterized complexity of team formation in social networks

被引：2

作者：

Bredereck, Robert ^{[1
,2
]}

Chen, Jiehua ^{[1
,3
]}

Hueffner, Falk ^{[1
]}

Kratsch, Stefan ^{[4
]}

机构：

[1] TU Berlin, Inst Softwaretech & Theoret Informat, Berlin, Germany

[2] Univ Oxford, Dept Comp Sci, Oxford, England

[3] Ben Gurion Univ Negev, Dept Ind Engn & Management, Beer Sheva, Israel

[4] Univ Bonn, Inst Informat 1, Bonn, Germany

来源：

THEORETICAL COMPUTER SCIENCE | 2018年 / 717卷

关键词：

Computational complexity analysis; Parameterized complexity analysis; Team formation on social networks;

D O I：

10.1016/j.tcs.2017.05.024

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

Given a task that requires some skills and a social network of individuals with differei skills, the TEAM FORMATION problem asks to find a team of individuals that together ca perform the task, while minimizing communication costs. Since the problem is NP-hard, identify the source of intractability by analyzing its parameterized complexity with respel to parameters such as the total number of skills k, the team size 1, the communication cost budget b, and the maximum vertex degree A. We show that the computation 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 fixes 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 A with either b or 1 yields fixed-parameter tractability. (C) 2017 Elsevier B.V. All rights reserved

引用

页码：26 / 36

页数：11

共 50 条

[21] Toward Efficient Team Formation for Crowdsourcing in Noncooperative Social Networks
Wang, Wanyuan
Jiang, Jiuchuan
An, Bo
Jiang, Yichuan
Chen, Bing
[J]. IEEE TRANSACTIONS ON CYBERNETICS, 2017, 47 (12) : 4208 - 4222
[22] Time Constraint-based Team Formation in Social Networks
Han, Xue
Liu, Yong
Guo, Xingkai
Wu, Xianyi
Song, Xiaolong
[J]. PROCEEDINGS 2013 INTERNATIONAL CONFERENCE ON MECHATRONIC SCIENCES, ELECTRIC ENGINEERING AND COMPUTER (MEC), 2013, : 1600 - 1604
[23] Task complexity and shared value orientation: exploring the moderators of a social dilemma in team social networks
Godart, Frederic C.
Cavarretta, Fabrice
Thiemann, Matthias
[J]. INDUSTRIAL AND CORPORATE CHANGE, 2016, 25 (05) : 739 - 756
[24] Approximate inference in Bayesian networks: Parameterized complexity results
Kwisthout, Johan
[J]. INTERNATIONAL JOURNAL OF APPROXIMATE REASONING, 2018, 93 : 119 - 131
[25] Parameterized Complexity of Inverse Scope Problems in Metabolic Networks
Liu, Hong
Feng, Haodi
Zhu, Daming
[J]. 2009 WASE INTERNATIONAL CONFERENCE ON INFORMATION ENGINEERING, ICIE 2009, VOL II, 2009, : 394 - 397
[26] Parameterized Complexity of Finding Elementary Modes in Metabolic Networks
Liu, Hong
Feng, Haodi
Zhu, Darning
[J]. 2009 INTERNATIONAL JOINT CONFERENCE ON BIOINFORMATICS, SYSTEMS BIOLOGY AND INTELLIGENT COMPUTING, PROCEEDINGS, 2009, : 479 - 482
[27] Team formation with influence maximization for influential event organization on social networks
Li, Cheng-Te
Huang, Mei-Yuan
Yan, Rui
[J]. WORLD WIDE WEB-INTERNET AND WEB INFORMATION SYSTEMS, 2018, 21 (04): : 939 - 959
[28] Team formation in social networks based on collective intelligence - an evolutionary approach
Awal, Gaganmeet Kaur
Bharadwaj, K. K.
[J]. APPLIED INTELLIGENCE, 2014, 41 (02) : 627 - 648
[29] Team formation in social networks based on collective intelligence – an evolutionary approach
Gaganmeet Kaur Awal
K. K. Bharadwaj
[J]. Applied Intelligence, 2014, 41 : 627 - 648
[30] Efficient Team Formation in Social Networks based on Constrained Pattern Graph
Kou, Yue
Shen, Derong
Snell, Quinn
Li, Dong
Nie, Tiezheng
Yu, Ge
Ma, Shuai
[J]. 2020 IEEE 36TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE 2020), 2020, : 889 - 900

← 1 2 3 4 5 →