Approximation algorithms for disjoint paths and related routing and packing problems (Q2757635)
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: Approximation algorithms for disjoint paths and related routing and packing problems |
scientific article; zbMATH DE number 1677132
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation algorithms for disjoint paths and related routing and packing problems |
scientific article; zbMATH DE number 1677132 |
Statements
26 November 2001
0 references
disjoint paths
0 references
approximation algorithms
0 references
unsplittable flow
0 references
routing
0 references
packing
0 references
integer programming
0 references
multicommodity flow
0 references
randomized algorithms
0 references
rounding
0 references
linear programming
0 references
Approximation algorithms for disjoint paths and related routing and packing problems (English)
0 references
