Lower bounds for two-period grooming via linear programming duality (Q3548731): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/net.20251 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4230698936 / rank | |||
Normal rank | |||
Revision as of 22:12, 19 March 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
