Computing Treewidth with Constraint Programming

Zusammenfassung
In this paper, we revisit a known SAT encoding for the fundamental combinatorial treewidth problem. Based on this encoding, we rework it within the constraint modeling language MiniZinc. Two MiniZinc encodings for treewidth are created and their performance is compared in an experimental evaluation. A further dimension for comparison is added by choosing between different backbone solvers supported by MiniZinc.
  • Vollständige Referenz
  • BibTeX
Voboril, F., (2022). Computing Treewidth with Constraint Programming. In: , . (Hrsg.), SKILL 2022. Gesellschaft für Informatik, Bonn. (S. 115-126).
@inproceedings{mci/Voboril2022,
author = {Voboril, Florentina},
title = {Computing Treewidth with Constraint Programming},
booktitle = {SKILL 2022},
year = {2022},
editor = {Gesellschaft für Informatik e.V.} ,
pages = { 115-126 },
publisher = {Gesellschaft für Informatik, Bonn},
address = {}
}
DateienGroesseFormatAnzeige
A4-2.pdf371.7Kb PDF Öffnen

Haben Sie fehlerhafte Angaben entdeckt? Sagen Sie uns Bescheid: Feedback abschicken

Mehr Information

ISBN: 978-3-88579-752-4
ISSN: 1614-3213
Datum: 2022
Sprache: en (en)
Sammlungen

Zur Langanzeige