Known Algorithms on Graphs of Bounded Treewidth are Probably Optimal

@inproceedings{Lokshtanov2011KnownAO,
  title={Known Algorithms on Graphs of Bounded Treewidth are Probably Optimal},
  author={Daniel Lokshtanov and D{\'a}niel Marx and Saket Saurabh},
  booktitle={ACM Trans. Algorithms},
  year={2011}
}
We obtain a number of lower bounds on the running time of algorithms solving problems on graphs of bounded treewidth. We prove the results under the Strong Exponential Time Hypothesis of Impagliazzo and Paturi. In particular, assuming that <i>n</i>-variable <i>m</i>-clause SAT cannot be solved in time (2-ε)<sup><i>n</i></sup><i>m</i><sup><i>O</i>(1)</sup>, we show that for any ε > 0: • I<scp>ndependent</scp> S<scp>et</scp> cannot be solved in time (2-ε)<sup>tw(<i>G</i>)</sup>|<i>V</i>(<i>G</i… CONTINUE READING
Highly Influential
This paper has highly influenced 11 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
97 Citations
9 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 97 extracted citations

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…