Logarithmic hardness of the undirected edge-disjoint paths problem (Q3455215)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6516099
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Logarithmic hardness of the undirected edge-disjoint paths problem |
scientific article; zbMATH DE number 6516099 |
Statements
Logarithmic hardness of the undirected edge-disjoint paths problem (English)
0 references
4 December 2015
0 references
hardness of approximation
0 references
edge-disjoint paths
0 references
undirected graphs
0 references
0.8681315183639526
0 references
0.8621794581413269
0 references
0.8314433693885803
0 references
0.8281695246696472
0 references
0.8280785083770752
0 references
