Parameterized Algorithms for Finding a Collective Set of Items
Authors: Robert Bredereck, Piotr Faliszewski, Andrzej Kaczmarczyk, Dušan Knop, Rolf Niedermeier1838-1845
AAAI 2020 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | We extend the work of Skowron et al. (AIJ, 2016) by considering the parameterized complexity of the following problem. We are given a set of items and a set of agents, where each agent assigns an integer utility value to each item. The goal is to find a set of k items that these agents would collectively use. |
| Researcher Affiliation | Academia | Robert Bredereck,1 Piotr Faliszewski,2 Andrzej Kaczmarczyk,1 Duˇsan Knop,1,3 Rolf Niedermeier1 1Technische Universit at Berlin, Chair of Algorithmics and Computational Complexity 2AGH University, Krak ow, Poland 3Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague, Prague, Czech Republic |
| Pseudocode | No | The paper describes algorithms and their steps within the text (e.g., in the proof of Theorem 1 and Theorem 6), but it does not provide structured pseudocode or algorithm blocks clearly labeled as 'Pseudocode' or 'Algorithm'. |
| Open Source Code | No | The paper does not contain any explicit statements about providing access to source code for the methodology described, nor does it include links to a code repository. |
| Open Datasets | No | This paper is theoretical and focuses on algorithmic complexity, not empirical evaluation. Thus, it does not refer to or provide access information for any datasets used for training or other purposes. |
| Dataset Splits | No | This paper is theoretical and does not involve empirical experiments with data. Therefore, it does not discuss or provide details about training, validation, or test dataset splits. |
| Hardware Specification | No | The paper is theoretical and does not describe experimental procedures or their execution environment. Therefore, no hardware specifications are mentioned. |
| Software Dependencies | No | The paper is theoretical and focuses on algorithmic complexity. While it references theoretical methods like 'Lenstra’s algorithm' and a result by 'Lokshtanov (2015)' in the context of integer programming, it does not list specific ancillary software components or their version numbers used to replicate experiments or implementations. |
| Experiment Setup | No | The paper is theoretical and does not describe empirical experiments. Therefore, it does not provide details about an experimental setup, including hyperparameters or system-level training settings. |