Hardness and Approximation of Traffic Grooming (Q5387787)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5279480
| 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 5279480 |
Statements
Hardness and Approximation of Traffic Grooming (English)
0 references
27 May 2008
0 references
Approximation Algorithms
0 references
Traffic Grooming
0 references
Optical Networks
0 references
SONET ADM
0 references
APX-hardness
0 references
PTAS
0 references
inapproximability
0 references
0.9865754246711732
0 references
0.915855348110199
0 references
0.9148097038269044
0 references
0.8857499957084656
0 references
0.8782066106796265
0 references
