A quasi-PTAS for unsplittable flow on line graphs (Q2931432)
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 6373944
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A quasi-PTAS for unsplittable flow on line graphs |
scientific article; zbMATH DE number 6373944 |
Statements
A quasi-PTAS for unsplittable flow on line graphs (English)
0 references
25 November 2014
0 references
approximation algorithms
0 references
approximation scheme
0 references
resource allocation
0 references
scheduling
0 references
unsplittable flow
0 references
0.842680811882019
0 references
0.8414678573608398
0 references
0.8278883695602417
0 references
