Complexity dichotomies for the minimum \(\mathcal{F}\)-overlay problem

DOI10.1007/978-3-319-78825-8_10zbMath1504.68158arXiv1703.05156OpenAlexW2802244013MaRDI QIDQ1642689

Nathann Cohen, Dorian Mazauric, Frédéric Havet, Ignasi Sau, Rémi Watrigant

Publication date: 15 June 2018

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

zbMATH Keywords

hypergraphNP-completenessfixed-parameter tractabilityminimum \(\mathcal{F}\)-overlay problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Parameterized complexity, tractability and kernelization (68Q27)

This page was built for publication: Complexity dichotomies for the minimum \(\mathcal{F}\)-overlay problem