Parameterized complexity of team formation in social networks

DOI10.1016/j.tcs.2017.05.024zbMath1388.68105OpenAlexW2621420628MaRDI QIDQ1704854

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

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)

Cites Work

• Unnamed Item
• Unnamed Item
• The multiple team formation problem using sociometry
• Fundamentals of parameterized complexity
• Parametrized complexity theory.
• Polylogarithmic inapproximability
• Fast Polynomial-Space Algorithms Using Möbius Inversion: Improving on Steiner Tree and Related Problems
• Minimum-diameter covering problems
• Parameterized Algorithms
• The steiner problem in graphs