The PACE 2019 Parameterized Algorithms and Computational Experiments Challenge: The Fourth Iteration (Invited Paper)

DOI10.4230/LIPIcs.IPEC.2019.25OpenAlexW2997686574MaRDI QIDQ5875560

Markus Hecher, Johannes K. Fichte, M. Ayaz Dzulfikar

Publication date: 3 February 2023

Full work available at URL: https://doi.org/10.4230/LIPIcs.IPEC.2019.25

zbMATH Keywords

parameterized algorithmsvertex cover problemFPThypertree decompositionsimplementation challenge

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68Wxx) Parameterized complexity, tractability and kernelization (68Q27)

Related Items (6)

Preprocessing to reduce the search space: antler structures for feedback vertex set ⋮ Exploiting Database Management Systems and Treewidth for Counting ⋮ Computing optimal hypertree decompositions with SAT ⋮ Fractional decomposition tree algorithm: a tool for studying the integrality gap of integer programs ⋮ The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth. ⋮ Fast and parallel decomposition of constraint satisfaction problems

This page was built for publication: The PACE 2019 Parameterized Algorithms and Computational Experiments Challenge: The Fourth Iteration (Invited Paper)