Parameterized complexity of team formation in social networks
type: Item
instance of: scholarly article
title: Parameterized complexity of team formation in social networks
zbMATH Open document ID: 1388.68105
author: Robert Bredereck
author: Jiehua Chen
author: Falk Hüffner
author: Stefan Kratsch
published in: Theoretical Computer Science
publication date: 2018-03-13T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 91D30
zbMATH DE Number: 6849498
zbMATH Keywords: computational complexity analysis
zbMATH Keywords: parameterized complexity analysis
zbMATH Keywords: team formation on social networks
MaRDI profile type: Publication
full work available at URL: j.tcs.2017.05.024
OpenAlex ID: W2621420628
cites work: Minimum-diameter covering problems
cites work: Introduction to algorithms
cites work: Parameterized Algorithms
cites work: Fundamentals of parameterized complexity
cites work: The steiner problem in graphs
cites work: Parametrized complexity theory.
cites work: The multiple team formation problem using sociometry
cites work: Polylogarithmic inapproximability
cites work: Fast Polynomial-Space Algorithms Using Möbius Inversion: Improving on Steiner Tree and Related Problems
cites work: Q5710169
DOI: 10.1016/J.TCS.2017.05.024
description: scientific article; zbMATH DE number 6849498