Key points are not available for this paper at this time.
We present a simple, self-contained, linear reduction from 3-SAT to Treewidth. Specifically, it shows that 1. 00005-approximating Treewidth is NP-hard, and solving Treewidth exactly requires 2^ (n) time, unless the Exponential-Time Hypothesis fails. We further derive, under the latter assumption, that there is some constant > 1 such that -approximating Treewidth requires time 2^n^{1-o (1) }.
Édouard Bonnet (Sun,) studied this question.