Approximation algorithms for optimization problems in graphs with superlogarithmic treewidth (Q1041722)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Approximation algorithms for optimization problems in graphs with superlogarithmic treewidth |
scientific article; zbMATH DE number 5642318
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation algorithms for optimization problems in graphs with superlogarithmic treewidth |
scientific article; zbMATH DE number 5642318 |
Statements
Approximation algorithms for optimization problems in graphs with superlogarithmic treewidth (English)
0 references
4 December 2009
0 references
approximation algorithms
0 references
NP-hard problems
0 references
partial \(k\)-trees
0 references
bounded treewidth
0 references
0 references
0.89971906
0 references
0.89464086
0 references
0.89055854
0 references
0.88615626
0 references
0.8859291
0 references
0.8856195
0 references
0.8852215
0 references
