Parameterized Complexity of Team Formation in Social Networks

DOI10.1007/978-3-319-41168-2_12zbMath1476.68115OpenAlexW2483394749MaRDI QIDQ2830065

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

Publication date: 9 November 2016

Published in: Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-41168-2_12

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Parameterized complexity, tractability and kernelization (68Q27)

Cites Work

• Unnamed Item
• Fundamentals of parameterized complexity
• 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

This page was built for publication: Parameterized Complexity of Team Formation in Social Networks