Parameterized complexity of team formation in social networks

Robert Bredereck, Jiehua Chen, Falk Hüffner, Stefan Kratsch

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

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.

Original languageEnglish
Title of host publicationAlgorithmic Aspects in Information and Management - 11th International Conference, AAIM 2016, Proceedings
EditorsRiccardo Dondi, Giancarlo Mauri, Guillaume Fertin
PublisherSpringer Verlag
Pages137-149
Number of pages13
ISBN (Print)9783319411675
DOIs
StatePublished - 1 Jan 2016
Externally publishedYes
Event11th International Conference on Algorithmic Aspects in Information and Management, AAIM 2016 - Bergamo, Italy
Duration: 18 Jul 201620 Jul 2016

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9778
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference11th International Conference on Algorithmic Aspects in Information and Management, AAIM 2016
Country/TerritoryItaly
CityBergamo
Period18/07/1620/07/16

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)

Fingerprint

Dive into the research topics of 'Parameterized complexity of team formation in social networks'. Together they form a unique fingerprint.

Cite this