The Parameterized Complexity of Connected Fair Division

Authors: Argyrios Deligkas, Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak

IJCAI 2021 | Conference PDF | Archive PDF | Plain Text | LLM Run Details

Reproducibility Variable Result LLM Response
Research Type Theoretical We study the Connected Fair Division problem (CFD)... We expand on previous results by providing a comprehensive complexity-theoretic understanding of CFD based on new algorithms and lower bounds... Overall, our results provide a comprehensive understanding of the precise boundaries of tractability of ϕ-CFD, introduce three novel algorithms for the problem, and show that the problem exhibits a rather diverse complexity-theoretic behavior.
Researcher Affiliation Academia Royal Holloway, University of London, UK; TU Wien, Austria; University of Leeds, UK
Pseudocode No The paper describes algorithmic ideas in prose (e.g., 'dynamic programming along the respective decompositions') but does not provide formal pseudocode blocks or algorithms.
Open Source Code No No statement or link is provided indicating that source code for the methodology described in the paper is open-source or publicly available.
Open Datasets No The paper is theoretical and does not use datasets for training or evaluation. Therefore, there is no information about public dataset availability.
Dataset Splits No The paper is theoretical and does not involve empirical experiments with datasets, so no training/validation/test splits are mentioned.
Hardware Specification No The paper is theoretical and does not describe any experiments that would require specific hardware, so no hardware specifications are mentioned.
Software Dependencies No The paper is theoretical and focuses on complexity, not implementation, so no specific software dependencies with version numbers are mentioned.
Experiment Setup No The paper is theoretical and does not describe empirical experiments, so no experimental setup details such as hyperparameters or system-level settings are provided.