A logarithmic approximation for unsplittable flow on line graphs (Q5501955)
From MaRDI portal
!
WARNING
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 6472769
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A logarithmic approximation for unsplittable flow on line graphs |
scientific article; zbMATH DE number 6472769 |
Statements
A logarithmic approximation for unsplittable flow on line graphs (English)
0 references
14 August 2015
0 references
approximation algorithms
0 references
resource allocation problem
0 references
scheduling
0 references
unsplittable flow
0 references
0 references
0.9059197
0 references
0.8914771
0 references
0.8880224
0 references
0.8878354
0 references
0.88742167
0 references
0.88572395
0 references
0.88255167
0 references
