A Cost-Efficient Scheduling Algorithm for Traffic Grooming (Q5405936)
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: A Cost-Efficient Scheduling Algorithm for Traffic Grooming |
scientific article; zbMATH DE number 6279078
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Cost-Efficient Scheduling Algorithm for Traffic Grooming |
scientific article; zbMATH DE number 6279078 |
Statements
A Cost-Efficient Scheduling Algorithm for Traffic Grooming (English)
0 references
3 April 2014
0 references
traffic grooming
0 references
fiber lengths minimization problem
0 references
minimizing total fiber length
0 references
longest link interval first (LLF)
0 references
