New hardness results for routing on disjoint paths (Q4977963)
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: New hardness results for routing on disjoint paths |
scientific article; zbMATH DE number 6761800
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New hardness results for routing on disjoint paths |
scientific article; zbMATH DE number 6761800 |
Statements
New hardness results for routing on disjoint paths (English)
0 references
17 August 2017
0 references
approximation algorithms
0 references
edge-disjoint paths
0 references
hardness of approximation
0 references
node-disjoint paths
0 references
routing problems
0 references
0.9936240315437316
0 references
0.9244938492774964
0 references
0.92081880569458
0 references
0.915999710559845
0 references
0.8904247283935547
0 references
