An O(log n)-Approximation Algorithm for the Edge-Disjoint Paths Problem in Eulerian Planar Graphs (Q2933646)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An O(log n)-Approximation Algorithm for the Edge-Disjoint Paths Problem in Eulerian Planar Graphs |
scientific article |
Statements
An O(log n)-Approximation Algorithm for the Edge-Disjoint Paths Problem in Eulerian Planar Graphs (English)
0 references
5 December 2014
0 references
4-edge-connected graph
0 references
edge-disjoint paths
0 references
Eulerian graph
0 references
approximation algorithm
0 references
