Known algorithms on graphs of bounded treewidth are probably optimal

DOI10.1145/3170442MaRDI QIDQ4554340zbMATH OpenOpenAlexWikidataFDO

Authors Daniel Lokshtanov, Dániel Marx, Saket Saurabh

Publication date 13 November 2018

Published in ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1007.5450

Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph theory (including graph drawing) in computer science (68R10)

Abstract: 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 SAT cannot be solved in (2-epsilon)^{n}m^{O(1)} time, we show that for any e > 0; {sc Independent Set} cannot be solved in (2-e)^{tw(G)}|V(G)|^{O(1)} time, {sc Dominating Set} cannot be solved in (3-e)^{tw(G)}|V(G)|^{O(1)} time, {sc Max Cut} cannot be solved in (2-e)^{tw(G)}|V(G)|^{O(1)} time, {sc Odd Cycle Transversal} cannot be solved in (3-e)^{tw(G)}|V(G)|^{O(1)} time, For any

q g e q 3

,

q

-{sc Coloring} cannot be solved in (q-e)^{tw(G)}|V(G)|^{O(1)} time, {sc Partition Into Triangles} cannot be solved in (2-e)^{tw(G)}|V(G)|^{O(1)} time. Our lower bounds match the running times for the best known algorithms for the problems, up to the e in the base.

Recommendations

Cited in

(65)

This page was built for publication: Known algorithms on graphs of bounded treewidth are probably optimal

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4554340)