An Improved Approximation Algorithm for the Edge-Disjoint Paths Problem with Congestion Two (Q4962640)
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: An Improved Approximation Algorithm for the Edge-Disjoint Paths Problem with Congestion Two |
scientific article; zbMATH DE number 6972801
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An Improved Approximation Algorithm for the Edge-Disjoint Paths Problem with Congestion Two |
scientific article; zbMATH DE number 6972801 |
Statements
An Improved Approximation Algorithm for the Edge-Disjoint Paths Problem with Congestion Two (English)
0 references
5 November 2018
0 references
Chekuri-Khanna-Shepherd well-linked decomposition
0 references
disjoint paths problem
0 references
Rao-Zhou algorithm
0 references
0.9580148
0 references
0.9523346
0 references
0.9318806
0 references
0.9318806
0 references
0.9119016
0 references
0.9045137
0 references
0.9045137
0 references
0.9036724
0 references
0.9030813
0 references
