New hardness results for routing on disjoint paths (Q3387753)
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
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New hardness results for routing on disjoint paths |
scientific article |
Statements
New Hardness Results for Routing on Disjoint Paths (English)
0 references
13 January 2021
0 references
approximation algorithms
0 references
hardness of approximation
0 references
disjoint paths
0 references
graph routing problems
0 references
0 references
0 references
0 references
0.9936240315437316
0 references
0.9273682832717896
0 references
0.917923390865326
0 references
0.9108145833015442
0 references
0.8865557909011841
0 references
