Parameterized complexity of team formation in social networks

DOI10.1016/J.TCS.2017.05.024MaRDI QIDQ1704854zbMATH OpenOpenAlexFDO

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

Publication date 13 March 2018

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2017.05.024

zbMATH Keywords

computational complexity analysisparameterized complexity analysisteam formation on social networks

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Social networks; opinion dynamics (91D30)

Recommendations

• Parameterized complexity of team formation in social networks
• The sociotechnical teams formation problem: a mathematical optimization approach
• A simple greedy algorithm for the profit-aware social team formation problem
• Research survey on team formation in social networks
• Integer programming approaches to the multiple team formation problem

Cites work

• Fast Polynomial-Space Algorithms Using Möbius Inversion: Improving on Steiner Tree and Related Problems
• Fundamentals of parameterized complexity
• scientific article; zbMATH DE number 2234775 (Why is no real title available?)
• Introduction to algorithms
• Minimum-diameter covering problems
• Parameterized algorithms
• Parametrized complexity theory.
• Polylogarithmic inapproximability
• The multiple team formation problem using sociometry
• The steiner problem in graphs

Cited in

(3)

• A simple greedy algorithm for the profit-aware social team formation problem
• Parameterized complexity of team formation in social networks
• The multiple team formation problem using sociometry

This page was built for publication: Parameterized complexity of team formation in social networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1704854)