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 this page instead for the normal view: Approximating the \(k\)-splittable capacitated network design problem |
scientific article; zbMATH DE number 6872113
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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