Approximation algorithms for optimization problems in graphs with superlogarithmic treewidth

Authors:
Artur Czumaj;Magnús M. Halldórsson;Andrzej Lingas;Johan Nilsson
Affiliations:
Department of Computer Science, New Jersey Institute of Technology, Newark, NJ 07102, USA;Department of Computer Science, University of Iceland, Reykjavik, Iceland;Department of Computer Science, Lund University, 22100 Lund, Sweden;BRICS22BRICS (Basic Research in Computer Science) is funded by the Danish National Research Foundation., Department Computer Science, University of Aarhus, DK-8200 Aarhus N, Denmark
Venue:
Information Processing Letters
Year:
2005

Citing 8
Cited 0

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

Quantified Score

Hi-index	0.89

Visualization

Abstract

We present a generic scheme for approximating NP-hard problems on graphs of treewidth k=@w(logn). When a tree-decomposition of width @? is given, the scheme typically yields an @?/logn-approximation factor; otherwise, an extra logk factor is incurred. Our method applies to several basic subgraph and partitioning problems, including the maximum independent set problem.