| GANIAN, Robert, M.S. RAMANUJAN a Stefan SZEIDER. Combining Treewidth and Backdoors for CSP. Online. In Heribert Vollmer and Brigitte Vallee. 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany. Nemecko: Dagstuhl-LIPIcs, 2017, s. 1-17. ISBN 978-3-95977-028-6. Dostupné z: https://dx.doi.org/10.4230/LIPIcs.STACS.2017.36. |
Další formáty:
BibTeX
LaTeX
RIS
@inproceedings{1414047,
author = {Ganian, Robert and Ramanujan, M.S. and Szeider, Stefan},
address = {Nemecko},
booktitle = {34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany},
doi = {http://dx.doi.org/10.4230/LIPIcs.STACS.2017.36},
editor = {Heribert Vollmer and Brigitte Vallee},
keywords = {Treewidth; Backdoors; Constraint Satisfaction},
howpublished = {elektronická verze "online"},
language = {eng},
location = {Nemecko},
isbn = {978-3-95977-028-6},
pages = {1-17},
publisher = {Dagstuhl-LIPIcs},
title = {Combining Treewidth and Backdoors for CSP},
url = {http://drops.dagstuhl.de/opus/volltexte/2017/6998/},
year = {2017}
}
TY - JOUR
ID - 1414047
AU - Ganian, Robert - Ramanujan, M.S. - Szeider, Stefan
PY - 2017
TI - Combining Treewidth and Backdoors for CSP
PB - Dagstuhl-LIPIcs
CY - Nemecko
SN - 9783959770286
KW - Treewidth
KW - Backdoors
KW - Constraint Satisfaction
UR - http://drops.dagstuhl.de/opus/volltexte/2017/6998/
L2 - http://drops.dagstuhl.de/opus/volltexte/2017/6998/
N2 - 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.
ER -
GANIAN, Robert, M.S. RAMANUJAN a Stefan SZEIDER. Combining Treewidth and Backdoors for CSP. Online. In Heribert Vollmer and Brigitte Vallee. \textit{34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany}. Nemecko: Dagstuhl-LIPIcs, 2017, s.~1-17. ISBN~978-3-95977-028-6. Dostupné z: https://dx.doi.org/10.4230/LIPIcs.STACS.2017.36.
|
