An \(O(\log n)\)-approximation algorithm for the edge-disjoint paths problem in Eulerian planar graphs (Q2933646)
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 O( n)-approximation algorithm for the edge-disjoint paths problem in Eulerian planar graphs |
scientific article; zbMATH DE number 6377156
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An \(O(\log n)\)-approximation algorithm for the edge-disjoint paths problem in Eulerian planar graphs |
scientific article; zbMATH DE number 6377156 |
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
0.9742262959480286
0 references
0.8542588353157043
0 references
0.8461434245109558
0 references
0.8458523750305176
0 references
