Group Activity Selection with Few Agent Types

Ganian, R, Ordyniak, S orcid.org/0000-0003-1935-651X and Rahul, CS (2023) Group Activity Selection with Few Agent Types. Algorithmica, 85. pp. 1111-1155. ISSN 0178-4617

Abstract

Metadata

Authors/Creators:
Copyright, Publisher and Additional Information: © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2022. This is an author produced version of an article published in Algorithmica. Uploaded in accordance with the publisher's self-archiving policy.
Keywords: FPT; Group activity selection problem; Multipartition subset sum; Tree width; Vertex cover number; W[1]-hardness; XP-algorithm
Dates:
  • Accepted: 3 November 2022
  • Published (online): 27 November 2022
  • Published: May 2023
Institution: The University of Leeds
Academic Units: The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds)
Funding Information:
FunderGrant number
EPSRC (Engineering and Physical Sciences Research Council)EP/V00252X/1
Depositing User: Symplectic Publications
Date Deposited: 06 Dec 2022 14:57
Last Modified: 27 Nov 2023 01:13
Published Version: https://link.springer.com/article/10.1007/s00453-0...
Status: Published
Publisher: Springer
Identification Number: https://doi.org/10.1007/s00453-022-01058-z

Export

Statistics