The complexity of bottleneck labeled graph problems (Q5961969)
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: The complexity of bottleneck labeled graph problems |
scientific article; zbMATH DE number 5786334
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of bottleneck labeled graph problems |
scientific article; zbMATH DE number 5786334 |
Statements
The complexity of bottleneck labeled graph problems (English)
0 references
16 September 2010
0 references
bottleneck labeled problems
0 references
approximation algorithms
0 references
hardness of approximation
0 references
\(s\)-\(t\) path
0 references
\(s\)-\(t\) cut
0 references
spanning tree
0 references
perfect matching
0 references
0 references
0 references
0.9527488946914672
0 references
0.8081431984901428
0 references
0.7978672981262207
0 references
0.7807151079177856
0 references
0.7618182301521301
0 references
