Group activity selection with few agent types

DOI10.1007/s00453-022-01058-zOpenAlexW2978416754MaRDI QIDQ2701380

C. S. Rahul, Robert Ganian, Sebastian Ordyniak

Publication date: 28 April 2023

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-022-01058-z

zbMATH Keywords

tree widthFPTW[1-hardness]vertex cover numbergroup activity selection problemXP-algorithmmultipartition subset sum

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (05Cxx)

Related Items (1)

Hedonic diversity games: a complexity picture with more than two colors

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fundamentals of parameterized complexity
• Group activity selection on graphs: parameterized analysis
• Group activity selection problem with approval preferences
• On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems
• NP-completeness in hedonic games
• On simplified group activity selection
• On structural parameterizations of the edge disjoint paths problem
• On structural parameterizations of the bounded-degree vertex deletion problem
• Group Activity Selection from Ordinal Preferences
• Graph Layout Problems Parameterized by Vertex Cover
• Parameterized Algorithms

This page was built for publication: Group activity selection with few agent types