Lower bounds for two-period grooming via linear programming duality (Q3548731)
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: Lower bounds for two-period grooming via linear programming duality |
scientific article; zbMATH DE number 5383025
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Lower bounds for two-period grooming via linear programming duality |
scientific article; zbMATH DE number 5383025 |
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
0.8504048585891724
0 references
0.8413607478141785
0 references
0.8308013081550598
0 references
0.8199812769889832
0 references
0.8173303008079529
0 references
