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.35
URN: urn:nbn:de:0030-drops-133382
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2020/13338/
Go to the corresponding LIPIcs Volume Portal

Trimble, James

PACE Solver Description: Tweed-Plus: A Subtree-Improving Heuristic Solver for Treedepth

pdf-format:
LIPIcs-IPEC-2020-35.pdf (0.3 MB)

Abstract

This paper introduces Tweed-Plus, a heuristic solver for the treedepth problem. The solver uses two well-known algorithms to create an initial elimination tree: nested dissection (making use of the Metis library) and the minimum-degree heuristic. After creating an elimination tree of the entire input graph, the solver continues to apply nested dissection and the minimum-degree heuristic to parts of the graph with the aim of replacing subtrees of the elimination tree with alternatives of lower depth.

BibTeX - Entry

@InProceedings{trimble:LIPIcs:2020:13338,
  author =	{James Trimble},
  title =	{{PACE Solver Description: Tweed-Plus: A Subtree-Improving Heuristic Solver for Treedepth}},
  booktitle =	{15th International Symposium on Parameterized and Exact Computation (IPEC 2020)},
  pages =	{35:1--35: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/13338},
  URN =		{urn:nbn:de:0030-drops-133382},
  doi =		{10.4230/LIPIcs.IPEC.2020.35},
  annote =	{Keywords: Treedepth, Elimination Tree, Heuristics}
}

Keywords: Treedepth, Elimination Tree, Heuristics
Collection: 15th International Symposium on Parameterized and Exact Computation (IPEC 2020)
Issue Date: 2020
Date of publication: 04.12.2020
Supplementary Material: DOI of code submitted to PACE Challenge: https://doi.org/10.5281/zenodo.3881441. The latest version of the code can be found on GitHub: https://github.com/jamestrimble/pace2020-treedepth-solvers.

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI