Breaking o(n <sup>1/2</sup> )-approximation algorithms for the edge-disjoint paths problem with congestion two (Q5419077)
From MaRDI portal
scientific article; zbMATH DE number 6301131
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Breaking o(n <sup>1/2</sup> )-approximation algorithms for the edge-disjoint paths problem with congestion two |
scientific article; zbMATH DE number 6301131 |
Statements
Breaking o(n <sup>1/2</sup> )-approximation algorithms for the edge-disjoint paths problem with congestion two (English)
0 references
5 June 2014
0 references
well-linked set
0 references
Rao-Zhou algorithm
0 references
disjoint paths
0 references
