A \(c^k n\) 5-approximation algorithm for treewidth (Q2799353)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6566956
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A \(c^k n\) 5-approximation algorithm for treewidth |
scientific article; zbMATH DE number 6566956 |
Statements
11 April 2016
0 references
algorithms
0 references
graphs
0 references
treewidth
0 references
approximation
0 references
fixed parameter tractability
0 references
0 references
0 references
0 references
A \(c^k n\) 5-approximation algorithm for treewidth (English)
0 references
0.873774528503418
0 references
0.8533332347869873
0 references
0.8344825506210327
0 references
0.8185709714889526
0 references
0.8002827167510986
0 references
