Constant-Factor Approximations of Branch-Decomposition and Largest Grid Minor of Planar Graphs in O(n 1 + ε ) Time (Q3652285)
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 5649450
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Constant-Factor Approximations of Branch-Decomposition and Largest Grid Minor of Planar Graphs in O(n 1 + ε ) Time |
scientific article; zbMATH DE number 5649450 |
Statements
Constant-Factor Approximations of Branch-Decomposition and Largest Grid Minor of Planar Graphs in O(n 1 + ε ) Time (English)
0 references
17 December 2009
0 references
constant-factor approximation algorithms
0 references
graph algorithms
0 references
optimal branch-decompositions
0 references
largest grid graph minors
0 references
1.0000002
0 references
0 references
0 references
0.88829416
0 references
0.88829416
0 references
0.87564707
0 references
0.8725719
0 references
