Document Open Access Logo

Backdoor Sets for CSP

Authors Serge Gaspers, Sebastian Ordyniak, Stefan Szeider

Thumbnail PDF


  • Filesize: 0.55 MB
  • 21 pages

Document Identifiers

Author Details

Serge Gaspers
Sebastian Ordyniak
Stefan Szeider

Cite AsGet BibTex

Serge Gaspers, Sebastian Ordyniak, and Stefan Szeider. Backdoor Sets for CSP. In The Constraint Satisfaction Problem: Complexity and Approximability. Dagstuhl Follow-Ups, Volume 7, pp. 137-157, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)


A backdoor set of a CSP instance is a set of variables whose instantiation moves the instance into a fixed class of tractable instances (an island of tractability). An interesting algorithmic task is to find a small backdoor set efficiently: once it is found we can solve the instance by solving a number of tractable instances. Parameterized complexity provides an adequate framework for studying and solving this algorithmic task, where the size of the backdoor set provides a natural parameter. In this survey we present some recent parameterized complexity results on CSP backdoor sets, focusing on backdoor sets into islands of tractability that are defined in terms of constraint languages.
  • Backdoor sets
  • Constraint satisfaction problems
  • Parameterized complexity
  • Polymorphisms


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail