An approximation algorithm for the tree \(t\)-spanner problem on unweighted graphs via generalized chordal graphs (Q472490)
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 6371109
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An approximation algorithm for the tree \(t\)-spanner problem on unweighted graphs via generalized chordal graphs |
scientific article; zbMATH DE number 6371109 |
Statements
An approximation algorithm for the tree \(t\)-spanner problem on unweighted graphs via generalized chordal graphs (English)
0 references
19 November 2014
0 references
graph algorithms
0 references
approximation algorithms
0 references
tree \(t\)-spanner problem
0 references
minimum max-stretch spanning tree problem
0 references
generalized chordal graphs
0 references
Robertson-Seymour's tree-decomposition
0 references
balanced separators
0 references
0 references
0 references
0 references
0 references
0.9983034133911132
0 references
0.8678407073020935
0 references
0.862454891204834
0 references
