Approximation algorithms and hardness results for labeled connectivity problems (Q2426652)
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 5266854
| 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 5266854 |
Statements
Approximation algorithms and hardness results for labeled connectivity problems (English)
0 references
23 April 2008
0 references
Labeled connectivity
0 references
Approximation algorithms
0 references
Hardness of approximation
0 references
0 references
0 references
0 references
0.988928496837616
0 references
0.874295711517334
0 references
0.8208432793617249
0 references
0.8169075846672058
0 references
0.8070839047431946
0 references
