Logo des Repositoriums
 

Computing Treewidth with Constraint Programming

dc.contributor.authorVoboril, Florentina
dc.contributor.editorGesellschaft für Informatik e.V.
dc.date.accessioned2023-02-21T09:39:17Z
dc.date.available2023-02-21T09:39:17Z
dc.date.issued2022
dc.description.abstractIn 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.en
dc.identifier.isbn978-3-88579-752-4
dc.identifier.pissn1614-3213
dc.identifier.urihttps://dl.gi.de/handle/20.500.12116/40231
dc.language.isoen
dc.publisherGesellschaft für Informatik, Bonn
dc.relation.ispartofSKILL 2022
dc.relation.ispartofseriesLecture Notes in Informatics (LNI) - Seminars, Volume S-18
dc.subjectTreewidth
dc.subjectSAT
dc.subjectConstraint Programming
dc.subjectMiniZinc
dc.titleComputing Treewidth with Constraint Programmingen
gi.citation.endPage126
gi.citation.startPage115
gi.conference.date29.-30. September 2022
gi.conference.locationHamburg
gi.conference.sessiontitleTheoretische Informatik

Dateien

Originalbündel
1 - 1 von 1
Lade...
Vorschaubild
Name:
A4-2.pdf
Größe:
371.78 KB
Format:
Adobe Portable Document Format