Efficient Approximation for Triangulation of Minimum Treewidth

Abstract

We present four novel approximation algorithms for finding triangulation of minimum treewidth. Two of the algorithms improve on the running times of algorithms by Robertson and Seymour, and Becker and Geiger that approximate the optimum by factors of 4 and 3 2/3, respectively. A third algorithm is faster than those but gives an approximation factor of 4 1/2. The last algorithm is yet faster, producing factor-O(lg/k) approximations in polynomial time. Finding triangulations of minimum treewidth for graphs is central to many problems in computer science. Real-world problems in artificial intelligence, VLSI design and databases are efficiently solvable if we have an efficient approximation algorithm for them. We report on experimental results confirming the effectiveness of our algorithms for large graphs associated with real-world problems.

Appears in Proceedings of the Seventeenth Conference on Uncertainty in Artificial Intelligence (UAI2001)

References in corpus (3)

• Object-Oriented Bayesian Networks
• Optimal Decomposition of Belief Networks
• A Sufficiently Fast Algorithm for Finding Close to Optimal Junction Trees

Cited by in corpus (7)

• Time and Parallelizability Results for Parity Games with Bounded Tree and DAG Width
• Dynamic Programming for Graphs on Surfaces
• Proving the NP-completeness of optimal moral graph triangulation
• Graph-based local elimination algorithms in discrete optimization
• Planar Disjoint-Paths Completion
• Graph Convolutional Policy for Solving Tree Decomposition via Reinforcement Learning Heuristics
• What makes normalized weighted satisfiability tractable