License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.IPEC.2020.33
URN: urn:nbn:de:0030-drops-133365
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2020/13336/
Swat, Sylwester
PACE Solver Description: Finding Elimination Trees Using ExTREEm - a Heuristic Solver for the Treedepth Decomposition Problem
Abstract
This article briefly describes the most important algorithms and techniques used in the treedepth decomposition heuristic solver called "ExTREEm", submitted to the 5th Parameterized Algorithms and Computational Experiments Challenge (PACE 2020) co-organized with the 15th International Symposium on Parameterized and Exact Computation (IPEC 2020).
BibTeX - Entry
@InProceedings{swat:LIPIcs:2020:13336,
author = {Sylwester Swat},
title = {{PACE Solver Description: Finding Elimination Trees Using ExTREEm - a Heuristic Solver for the Treedepth Decomposition Problem}},
booktitle = {15th International Symposium on Parameterized and Exact Computation (IPEC 2020)},
pages = {33:1--33:4},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-172-6},
ISSN = {1868-8969},
year = {2020},
volume = {180},
editor = {Yixin Cao and Marcin Pilipczuk},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2020/13336},
URN = {urn:nbn:de:0030-drops-133365},
doi = {10.4230/LIPIcs.IPEC.2020.33},
annote = {Keywords: Treedepth decomposition, elimination tree, separator, PACE 2020}
}
Keywords: |
|
Treedepth decomposition, elimination tree, separator, PACE 2020 |
Collection: |
|
15th International Symposium on Parameterized and Exact Computation (IPEC 2020) |
Issue Date: |
|
2020 |
Date of publication: |
|
04.12.2020 |
Supplementary Material: |
|
The source code of ExTREEm solver is available at https://doi.org/10.5281/zenodo.3873126. |