Backdoor Sets for CSP

Gaspers, Serge; Ordyniak, Sebastian; Szeider, Stefan

doi:10.4230/DFU.Vol7.15301.137

by Serge Gaspers, Sebastian Ordyniak, Stefan Szeider

Reference:

Backdoor Sets for CSPSerge Gaspers, Sebastian Ordyniak, Stefan SzeiderChapter in The Constraint Satisfaction Problem: Complexity and Approximability (Andrei A. Krokhin, Stanislav Zivny, eds.), volume 7 of Dagstuhl Follow-Ups, pages 137–157, 2017, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.

Bibtex Entry:

@incollection{GaspersOrdyniakSzeider17,
  author    = {Serge Gaspers and
               Sebastian Ordyniak and
               Stefan Szeider},
  title     = {Backdoor Sets for {CSP}},
  booktitle = {The Constraint Satisfaction Problem: Complexity and Approximability},
  pages     = {137--157},
  year      = {2017},
  editor    = {Andrei A. Krokhin and
               Stanislav Zivny},
  series    = {Dagstuhl Follow-Ups},
  volume    = {7},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  url       = {http://www.dagstuhl.de/dagpub/978-3-95977-003-3},
  doi =	     {10.4230/DFU.Vol7.15301.137},
}