Approximation algorithms for optimization problems in graphs with superlogarithmic treewidth

被引：2

作者：

Czumaj, A

Halldórsson, MM

Lingas, A ^{[1
]}

Nilsson, J

机构：

[1] Lund Univ, Dept Comp Sci, S-22100 Lund, Sweden

[2] Univ Iceland, Dept Comp Sci, Reykjavik, Iceland

[3] New Jersey Inst Technol, Dept Comp Sci, Newark, NJ 07102 USA

[4] Aarhus Univ, Dept Comp Sci, BRICS2, DK-8200 Aarhus, Denmark

来源：

INFORMATION PROCESSING LETTERS | 2005年 / 94卷 / 02期

基金：

美国国家科学基金会;

关键词：

approximation algorithms; NP-hard problems; partial k-trees; bounded treewidth;

D O I：

10.1016/j.ipl.2004.12.017

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

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

引用

页码：49 / 53

页数：5

共 50 条

[1] Improved approximation algorithms for optimization problems in graphs with superlogarithmic treewidth
Czumaj, A
Lingas, A
Nilsson, J
[J]. ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2003, 2906 : 544 - 553
[2] Approximation Algorithms for Treewidth
Eyal Amir
[J]. Algorithmica, 2010, 56 : 448 - 479
[3] Approximation Algorithms for Treewidth
Amir, Eyal
[J]. ALGORITHMICA, 2010, 56 (04) : 448 - 479
[4] Approximation Algorithms for Optimization Problems in Random Power-Law Graphs
Shen, Yilin
Li, Xiang
Thai, My T.
[J]. COMBINATORIAL OPTIMIZATION AND APPLICATIONS (COCOA 2014), 2014, 8881 : 343 - 355
[5] BETTER ALGORITHMS FOR THE PATHWIDTH AND TREEWIDTH OF GRAPHS
BODLAENDER, HL
KLOKS, T
[J]. LECTURE NOTES IN COMPUTER SCIENCE, 1991, 510 : 544 - 555
[6] Reduction algorithms for graphs of small treewidth
Bodlaender, HL
van Antwerpen-de Fluiter, B
[J]. INFORMATION AND COMPUTATION, 2001, 167 (02) : 86 - 119
[7] Dynamic algorithms for graphs of bounded treewidth
Hagerup, T
[J]. ALGORITHMICA, 2000, 27 (3-4) : 292 - 315
[8] Dynamic Algorithms for Graphs of Bounded Treewidth
T. Hagerup
[J]. Algorithmica, 2000, 27 : 292 - 315
[9] Algorithms based on the treewidth of sparse graphs
Kneis, J
Mölle, D
Richter, S
Rossmanith, P
[J]. GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2005, 3787 : 385 - 396
[10] Dynamic algorithms for graphs of bounded treewidth
Hagerup, T
[J]. AUTOMATA, LANGUAGES AND PROGRAMMING, 1997, 1256 : 292 - 302

← 1 2 3 4 5 →