Hardness and Approximation of Traffic Grooming (Q5387787): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 01:56, 9 February 2024
scientific article; zbMATH DE number 5279480
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
