An O(log n)-Approximation Algorithm for the Edge-Disjoint Paths Problem in Eulerian Planar Graphs (Q2933646): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1145/2438645.2438648 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2035272561 / rank | |||
Normal rank |
Latest revision as of 03:05, 20 March 2024
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