Group activity selection on graphs: parameterized analysis

DOI10.1007/978-3-319-66700-3_9zbMath1403.91068MaRDI QIDQ681851

Meirav Zehavi, Saket Saurabh, Sushmita Gupta, Sanjukta Roy

Publication date: 13 February 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-66700-3_9

zbMATH Keywords

NP-hard; Nash stability; group activity selection problem

Mathematics Subject Classification ID

91A43: Games involving graphs

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)