Almost polynomial hardness of node-disjoint paths in grids (Q5230375)
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: Almost polynomial hardness of node-disjoint paths in grids |
scientific article; zbMATH DE number 7097080
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Almost polynomial hardness of node-disjoint paths in grids |
scientific article; zbMATH DE number 7097080 |
Statements
Almost polynomial hardness of node-disjoint paths in grids (English)
0 references
22 August 2019
0 references
computation network flows
0 references
computation routing
0 references
network design problems
0 references
reductions
0 references
completeness
0 references
0.9273682832717896
0 references
0.9244938492774964
0 references
0.9093574285507202
0 references
0.8973785042762756
0 references
0.8672915101051331
0 references
