Approximating the \(k\)-splittable capacitated network design problem (Q2927658)
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 6365540
| 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 6365540 |
Statements
Approximating the k-Splittable Capacitated Network Design Problem (English)
0 references
4 November 2014
0 references
approximation algorithm
0 references
graph algorithm
0 references
routing problems
0 references
network optimization
0 references
0.9958860874176024
0 references
0.8478031754493713
0 references
0.8250782489776611
0 references
0.8239664435386658
0 references
