Lower bounds for two-period grooming via linear programming duality (Q3548731): Difference between revisions
From MaRDI portal
Latest revision as of 22:59, 28 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Lower bounds for two-period grooming via linear programming duality |
scientific article |
Statements
Lower bounds for two-period grooming via linear programming duality (English)
0 references
17 December 2008
0 references
optical networks
0 references
traffic grooming
0 references
graph decomposition
0 references
combinatorial designs
0 references
linear programming duality
0 references
0 references