Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems (Q5917535)
From MaRDI portal
scientific article; zbMATH DE number 2092860
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems |
scientific article; zbMATH DE number 2092860 |
Statements
Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems (English)
0 references
19 August 2004
0 references
Approximation algorithms
0 references
Bounded length edge-disjoint paths
0 references
Edge-disjoint
0 references
paths
0 references
Hardness of approximation
0 references
Multicommodity flow
0 references
Network routing
0 references
Unsplittable flow
0 references
Vertex-disjoint paths
0 references
0 references
0 references
