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.STACS.2017.36
URN: urn:nbn:de:0030-drops-69986
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2017/6998/
Go to the corresponding LIPIcs Volume Portal

Ganian, Robert ; Ramanujan, M. S. ; Szeider, Stefan

Combining Treewidth and Backdoors for CSP

pdf-format:
LIPIcs-STACS-2017-36.pdf (0.7 MB)

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) 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.

BibTeX - Entry

@InProceedings{ganian_et_al:LIPIcs:2017:6998,
  author =	{Robert Ganian and M. S. Ramanujan and Stefan Szeider},
  title =	{{Combining Treewidth and Backdoors for CSP}},
  booktitle =	{34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)},
  pages =	{36:1--36:17},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-028-6},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{66},
  editor =	{Heribert Vollmer and Brigitte ValleĢe},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2017/6998},
  URN =		{urn:nbn:de:0030-drops-69986},
  doi =		{10.4230/LIPIcs.STACS.2017.36},
  annote =	{Keywords: Algorithms and data structures, Fixed Parameter Tractability, Constraint Satisfaction}
}

Keywords: Algorithms and data structures, Fixed Parameter Tractability, Constraint Satisfaction
Collection: 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)
Issue Date: 2017
Date of publication: 06.03.2017

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