Summary: Appears in Proceedings of 17th Conference on Uncertainty in Artificial Intelligence (UAI '01).
Efficient Approximation for Triangulation of Minimum Treewidth
Eyal Amir
Department of Computer Science,
Gates Building, 2A wing
Stanford University, Stanford, CA 94305­9020, USA
eyal.amir@cs.stanford.edu
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 op­
timum 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

Source: Amir, Eyal - Department of Computer Science, University of Illinois at Urbana-Champaign

Collections: Computer Technologies and Information Sciences