Approximation Algorithms and Hardness Results for Labeled Connectivity Problems (Q5756701)
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: Approximation Algorithms and Hardness Results for Labeled Connectivity Problems |
scientific article; zbMATH DE number 5187359
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation Algorithms and Hardness Results for Labeled Connectivity Problems |
scientific article; zbMATH DE number 5187359 |
Statements
Approximation Algorithms and Hardness Results for Labeled Connectivity Problems (English)
0 references
5 September 2007
0 references
0 references
0.90303516
0 references
0 references
0 references
0.89917284
0 references
0.8976519
0 references
0.8976519
0 references
0.8948453
0 references
