A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
Solvingd-SAT via Backdoors to Small Treewidth
[chapter]
2014
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms
One of our main technical contributions is a linear time "protrusion replacer" improving over a O(n log 2 n)-time procedure of Fomin et al. (FOCS 2012). The new deterministic linear time protrusion replacer has several applications in kernelization and parameterized algorithms. At first glance, the problem of detecting a weak W ηbackdoor set resembles the algorithmic graph problem of deleting at most k vertices such that the new graph is of treewidth at most t. However, as it was observed by
doi:10.1137/1.9781611973730.43
dblp:conf/soda/FominLMRS15
fatcat:4hppsxbm3feybggwnxhjnxv2fq