scientific article; zbMATH DE number 7525485

DOI10.4230/LIPIcs.ESA.2019.48MaRDI QIDQ5075791

Sebastian Ordyniak, Robert Ganian, C. S. Rahul

Publication date: 11 May 2022

Full work available at URL: https://arxiv.org/abs/1808.06954

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

multi-agent systemsgroup activity selection problemparameterized complexity analysis

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (3)

Simplified group activity selection with group size constraints ⋮ Fair and efficient allocation with few agent types, few item types, or small value levels ⋮ Parameterized complexity of envy-free resource allocation in social networks

Cites Work

• Unnamed Item
• Unnamed Item
• Fundamentals of parameterized complexity
• Group activity selection on graphs: parameterized analysis
• Group activity selection problem with approval preferences
• On simplified group activity selection
• 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: