Approximating the \(k\)-splittable capacitated network design problem (Q1751198)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6872113
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximating the \(k\)-splittable capacitated network design problem |
scientific article; zbMATH DE number 6872113 |
Statements
Approximating the \(k\)-splittable capacitated network design problem (English)
0 references
24 May 2018
0 references
approximation algorithms
0 references
graph algorithms
0 references
routing problems
0 references
network optimization
0 references
0.9958860874176024
0 references
0.8366301655769348
0 references
0.8115479350090027
0 references
0.8101999163627625
0 references
