The inapproximability of maximum single-sink unsplittable, priority and confluent flow problems (Q4602397)
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: The inapproximability of maximum single-sink unsplittable, priority and confluent flow problems |
scientific article; zbMATH DE number 6823766
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The inapproximability of maximum single-sink unsplittable, priority and confluent flow problems |
scientific article; zbMATH DE number 6823766 |
Statements
10 January 2018
0 references
algorithms
0 references
complexity theory
0 references
multiflow
0 references
network flow
0 references
unsplittable flow
0 references
confluent flow
0 references
priority flow
0 references
0.8408608436584473
0 references
0.8369537591934204
0 references
0.8359541296958923
0 references
0.8357049226760864
0 references
