Linear time algorithms for NP-hard problems restricted to partial k-trees
Discrete Applied Mathematics
Easy problems for tree-decomposable graphs
Journal of Algorithms
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
SIAM Journal on Computing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Algorithms for Vertex Partitioning Problems on Partial k-Trees
SIAM Journal on Discrete Mathematics
Efficient Approximation for Triangulation of Minimum Treewidth
UAI '01 Proceedings of the 17th Conference in Uncertainty in Artificial Intelligence
Improved Inapproximability Results for MaxClique, Chromatic Number and Approximate Graph Coloring
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Approximating Maximum Clique by Removing Subgraphs
SIAM Journal on Discrete Mathematics
Convergent SparseDT topology control protocol in dense sensor networks
Proceedings of the 2nd international conference on Scalable information systems
Hi-index | 0.89 |
We present a generic scheme for approximating NP-hard problems on graphs of treewidth k = ω(logn). When a tree-decomposition of width l is given, the scheme typically yields an l/log n-approximation factor; otherwise, an extra log k factor is incurred. Our method applies to several basic subgraph and partitioning problems, including the maximum independent set problem.