Hardness and approximation of traffic grooming (Q837166)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hardness and approximation of traffic grooming |
scientific article |
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
