Hardness results and an exact exponential algorithm for the spanning tree congestion problem (Q5891346)
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: Hardness results and an exact exponential algorithm for the spanning tree congestion problem |
scientific article; zbMATH DE number 6234169
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hardness results and an exact exponential algorithm for the spanning tree congestion problem |
scientific article; zbMATH DE number 6234169 |
Statements
28 November 2013
0 references
non-sparse graph classes
0 references
constant-factor approximation algorithm for cographs
0 references
linear-time algorithm for chordal cographs
0 references
spanning tree congestion
0 references
0 references
0.9415363
0 references
0 references
0.9217952
0 references
0 references
0.87716216
0 references
0 references
0 references
0.8768047
0 references
Hardness results and an exact exponential algorithm for the spanning tree congestion problem (English)
0 references
