Improved approximation algorithms for optimization problems in graphs with superlogarithmic treewidth

Authors

Artur Czumaj, Department of Computer Science
Andrzej Lingas, Lunds Universitet
Johan Nilsson, Lunds Universitet

Document Type

Article

Publication Date

1-1-2003

Abstract

In this paper we present two novel generic schemes for approximation algorithms for optimization NP-hard graph problems constrained to partial k-trees. Our first scheme yields deterministic polynomial-time algorithms achieving typically an approximation factor of k/log^1-∈ n, where k = polylog(n). The second scheme yields randomized polynomial-time algorithms achieving an approximation factor of k/logn for k = Ω(log n). Both our approximation methods lead to the best known approximation guarantees for some basic optimization problems. In particular, we obtain best known polynomial-time approximation guarantees for the classical maximum independent set problem in partial trees. © Springer-Verlag Berlin Heidelberg 2003.

Identifier

35248840531 (Scopus)

ISBN

[9783540206958]

Publication Title

Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics

External Full Text Location

https://doi.org/10.1007/978-3-540-24587-2_56

e-ISSN

16113349

ISSN

03029743

First Page

544

Last Page

553

Volume

2906

Recommended Citation

Czumaj, Artur; Lingas, Andrzej; and Nilsson, Johan, "Improved approximation algorithms for optimization problems in graphs with superlogarithmic treewidth" (2003). Faculty Publications. 14412.
https://digitalcommons.njit.edu/fac_pubs/14412