Combining Treewidth and Backdoors for CSP.
From MaRDI portal
Publication:4636635
DOI10.4230/LIPICS.STACS.2017.36zbMATH Open1402.68094arXiv1610.03298OpenAlexW2963805305MaRDI QIDQ4636635FDOQ4636635
Robert Ganian, Stefan Szeider, M. S. Ramanujan
Publication date: 19 April 2018
Abstract: 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) by structural restrictions on the interaction between the variables and the constraints and (ii) by 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.
Full work available at URL: https://arxiv.org/abs/1610.03298
Cited In (12)
- Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic Programs
- Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth.
- A Fixed-Parameter Tractable Algorithm for Elimination Distance to Bounded Degree Graphs
- SAT backdoors: depth beats size
- CSP beyond tractable constraint languages
- Backdoors into heterogeneous classes of SAT and CSP
- Solving projected model counting by utilizing treewidth and its limits
- On the Parameterized Complexity of Clique Elimination Distance
- Measuring what matters: a hybrid approach to dynamic programming with treewidth
- FPT algorithms to compute the elimination distance to bipartite graphs and more
- Distance from triviality 2.0: hybrid parameterizations
- Backdoor Sets for CSP.
This page was built for publication: Combining Treewidth and Backdoors for CSP.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4636635)
