Approximation Algorithms for Treewidth

Abstract. This paper presents algorithms whose input is an undirected graph, and whose output is a tree decomposition of width that approximates the optimal, the treewidth of that graph. The algorithms differ in their computation time and their approximation guarantees. The first algorithm works in polynomial-time and finds a factor-O(log OPT), where OPT is the treewidth of the graph. This is the first polynomial-time algorithm that approximates the optimal by a factor that does not depend on n, the number of nodes in the input graph. As a result, we get an algorithm for finding pathwidth within a factor of O(log OPT

• Type: Journal
• Year: 2010
• Where: ALGORITHMICA
• Authors: Eyal Amir
• Keywords: ALGORITHMICA 2010, Algorithms, Treewidth, Undirected Graph