Group activity selection on graphs: parameterized analysis
From MaRDI portal
Publication:681851
DOI10.1007/978-3-319-66700-3_9zbMath1403.91068OpenAlexW2745383889MaRDI QIDQ681851
Meirav Zehavi, Sanjukta Roy, Saket Saurabh, Sushmita Gupta
Publication date: 13 February 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-66700-3_9
Games involving graphs (91A43) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (7)
Simplified group activity selection with group size constraints ⋮ Group activity selection problem with approval preferences ⋮ On Treewidth and Stable Marriage: Parameterized Algorithms and Hardness Results (Complete Characterization) ⋮ Group activity selection with few agent types ⋮ Unnamed Item ⋮ Balanced stable marriage: how close is close enough? ⋮ Cooperative games with overlapping coalitions: charting the tractability frontier
This page was built for publication: Group activity selection on graphs: parameterized analysis
