Known algorithms on graphs of bounded treewidth are probably optimal
Clinical Orthopaedics and Related Research(2018)
摘要
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 - ∈)nmO(1) time, we show that for any ∈ > 0;
• Independent Set cannot be solved in time (2 − ε)tw(G) |V(G)|O(1),
• Dominating Set cannot be solved in time (3 − ε)tw(G) |V(G)|O(1),
• Max Cut cannot be solved in time (2 − ε)tw(G) |V(G)|O(1),
• Odd Cycle Transversal cannot be solved in time (3 − ε)tw(G) |V(G)|O(1),
• For any q ≥ 3, q-Coloring cannot be solved in time (q − ε)tw(G) |V(G)|O(1),
• Partition Into Triangles cannot be solved in time (2 − ε)tw(G) |V(G)|O(1).
Our lower bounds match the running times for the best known algorithms for the problems, up to the ε in the base.
更多查看译文
关键词
bounded treewidth,odd cycle transversal,independent set,known algorithm,max cut,dominating set,lower bound,strong exponential time hypothesis,distributed computing,leader election,randomized algorithms
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要