An Approximation Algorithm for Fully Planar Edge-Disjoint Paths (Q4986808)
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 Approximation Algorithm for Fully Planar Edge-Disjoint Paths |
scientific article; zbMATH DE number 7340683
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An Approximation Algorithm for Fully Planar Edge-Disjoint Paths |
scientific article; zbMATH DE number 7340683 |
Statements
An Approximation Algorithm for Fully Planar Edge-Disjoint Paths (English)
0 references
28 April 2021
0 references
approximation algorithm
0 references
edge-disjoint paths
0 references
planar graphs
0 references
0 references
0 references
0.9533299
0 references
0.9387325
0 references
0.93559766
0 references
0.93244463
0 references
0.9301001
0 references
0.9268947
0 references
0.92653126
0 references
0.92653126
0 references
