Approximation algorithms for optimization problems in graphs with superlogarithmic treewidth

Document Type

Article

Publication Date

4-30-2005

Abstract

We present a generic scheme for approximating NP-hard problems on graphs of treewidth k=ω(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. © 2004 Elsevier B.V. All rights reserved.

Identifier

14644444118 (Scopus)

Publication Title

Information Processing Letters

External Full Text Location

https://doi.org/10.1016/j.ipl.2004.12.017

ISSN

00200190

First Page

49

Last Page

53

Issue

2

Volume

94

Grant

CCR-0105701

Fund Ref

National Science Foundation

This document is currently not available here.

Share

COinS