Hardness and approximation of traffic grooming (Q837166)
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 and approximation of traffic grooming |
scientific article; zbMATH DE number 5602736
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hardness and approximation of traffic grooming |
scientific article; zbMATH DE number 5602736 |
Statements
Hardness and approximation of traffic grooming (English)
0 references
10 September 2009
0 references
traffic grooming
0 references
optical networks
0 references
SONET ADM
0 references
approximation algorithms
0 references
APX-hardness
0 references
PTAS
0 references
1.0000004
0 references
0.93805236
0 references
0 references
0.9155851
0 references
0.9056292
0 references
0.8956618
0 references
0.8953827
0 references
0.88771224
0 references
0.88771224
0 references
