Approximation algorithms for the unsplittable flow problem on paths and trees (Q2957504)
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: Approximation algorithms for the unsplittable flow problem on paths and trees |
scientific article; zbMATH DE number 6678457
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation algorithms for the unsplittable flow problem on paths and trees |
scientific article; zbMATH DE number 6678457 |
Statements
26 January 2017
0 references
approximation algorithms
0 references
integer decomposition
0 references
linear programming
0 references
scheduling
0 references
unsplittable flows
0 references
Approximation Algorithms for the Unsplittable Flow Problem on Paths and Trees (English)
0 references
0.8910092711448669
0 references
0.8776569366455078
0 references
0.8774348497390747
0 references
