Group activity selection with few agent types

DOI10.1007/S00453-022-01058-ZMaRDI QIDQ2701380zbMATH OpenOpenAlexFDO

Authors Robert Ganian, Sebastian Ordyniak, C. S. Rahul

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

FPTW[1-hardness]tree widthvertex cover numbergroup activity selection problemXP-algorithmmultipartition subset sum

Mathematics Subject Classification ID

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

Recommendations

• Group activity selection with few agent types
• Simplified group activity selection with group size constraints
• Group activity selection from ordinal preferences
• On simplified group activity selection
• Group activity selection problem with approval preferences
• Group activity selection on graphs: parameterized analysis
• Manipulability in a group activity selection problem
• A social choice approach to ordinal group activity selection
• Stable and Pareto optimal group activity selection from ordinal preferences

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1989615 (Why is no real title available?)
• scientific article; zbMATH DE number 2234775 (Why is no real title available?)
• Fundamentals of parameterized complexity
• Graph Layout Problems Parameterized by Vertex Cover
• Group activity selection from ordinal preferences
• Group activity selection on graphs: parameterized analysis
• Group activity selection problem with approval preferences
• NP-completeness in hedonic games
• On simplified group activity selection
• On structural parameterizations of the bounded-degree vertex deletion problem
• On structural parameterizations of the edge disjoint paths problem
• On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems
• Parameterized algorithms

Cited in

(5)

• On simplified group activity selection
• Simplified group activity selection with group size constraints
• Hedonic diversity games: a complexity picture with more than two colors
• Algorithms and complexity of difference logic
• Group activity selection on graphs: parameterized analysis

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

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