Routing with congestion in acyclic digraphs (Q2274522)
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 7107780
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Routing with congestion in acyclic digraphs |
scientific article; zbMATH DE number 7107780 |
Statements
Routing with congestion in acyclic digraphs (English)
0 references
20 September 2019
0 references
algorithms
0 references
disjoint paths
0 references
congestion
0 references
acyclic digraphs
0 references
W[1]-hard problem
0 references
0 references
0 references
0.7879490256309509
0 references
0.7876165509223938
0 references
0.7838839888572693
0 references
0.7814481854438782
0 references
