Publication details
Combining Treewidth and Backdoors for CSP
| Authors | |
|---|---|
| Year of publication | 2017 |
| Type | Article in Proceedings |
| Conference | 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany |
| MU Faculty or unit | |
| Citation | |
| Web | http://drops.dagstuhl.de/opus/volltexte/2017/6998/ |
| Doi | http://dx.doi.org/10.4230/LIPIcs.STACS.2017.36 |
| Keywords | Treewidth; Backdoors; Constraint Satisfaction |
| Description | We show that CSP is fixed-parameter tractable when parameterized by the treewidth of a backdoor into any tractable CSP problem over a finite constraint language. This result combines the two prominent approaches for achieving tractability for CSP: (i) structural restrictions on the interaction between the variables and the constraints and (ii) language restrictions on the relations that can be used inside the constraints. Apart from defining the notion of backdoor-treewidth and showing how backdoors of small treewidth can be used to efficiently solve CSP, our main technical contribution is a fixed-parameter algorithm that finds a backdoor of small treewidth. |