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.36
URN: urn:nbn:de:0030-drops-133391
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2020/13339/
Wrochna, Marcin
PACE Solver Description: Sallow: A Heuristic Algorithm for Treedepth Decompositions
Abstract
We describe a heuristic algorithm for computing treedepth decompositions, submitted for the https://pacechallenge.org/2020 challenge. It relies on a variety of greedy algorithms computing elimination orderings, as well as a Divide & Conquer approach on balanced cuts obtained using a from-scratch reimplementation of the 2016 FlowCutter algorithm by Hamann & Strasser [Michael Hamann and Ben Strasser, 2018].
BibTeX - Entry
@InProceedings{wrochna:LIPIcs:2020:13339,
author = {Marcin Wrochna},
title = {{PACE Solver Description: Sallow: A Heuristic Algorithm for Treedepth Decompositions}},
booktitle = {15th International Symposium on Parameterized and Exact Computation (IPEC 2020)},
pages = {36:1--36: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/13339},
URN = {urn:nbn:de:0030-drops-133391},
doi = {10.4230/LIPIcs.IPEC.2020.36},
annote = {Keywords: treedepth, decomposition, heuristic, weak colouring numbers}
}
Keywords: |
|
treedepth, decomposition, heuristic, weak colouring numbers |
Collection: |
|
15th International Symposium on Parameterized and Exact Computation (IPEC 2020) |
Issue Date: |
|
2020 |
Date of publication: |
|
04.12.2020 |
Supplementary Material: |
|
Code: http://doi.org/10.5281/zenodo.3870565. |