
Approximation schemes for bounded distance problems on fractionally treewidthfragile graphs
We give polynomialtime approximation schemes for monotone maximization ...
read it

A SingleExponential Time 2Approximation Algorithm for Treewidth
We give an algorithm, that given an nvertex graph G and an integer k, i...
read it

On Guarding Orthogonal Polygons with Bounded Treewidth
There exist many variants of guarding an orthogonal polygon in an orthog...
read it

An Improvement of Reed's Treewidth Approximation
We present a new approximation algorithm for the treewidth problem which...
read it

Approximating minimum representations of key Horn functions
Horn functions form a subclass of Boolean functions and appear in many d...
read it

Coresets for Triangulation
Multipleview triangulation by ℓ_∞ minimisation has become established i...
read it

Approximation Algorithms for the Loop Cutset Problem
We show how to find a small loop curser in a Bayesian network. Finding s...
read it
Efficient Approximation for Triangulation of Minimum Treewidth
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 factorO(lg/k) approximations in polynomial time. Finding triangulations of minimum treewidth for graphs is central to many problems in computer science. Realworld 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 realworld problems.
READ FULL TEXT
Comments
There are no comments yet.