A near-linear time constant factor algorithm for unsplittable flow problem on line with bag constraints (Q2908848)
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 6073530
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A near-linear time constant factor algorithm for unsplittable flow problem on line with bag constraints |
scientific article; zbMATH DE number 6073530 |
Statements
29 August 2012
0 references
approximation algorithms
0 references
scheduling
0 references
resource allocation
0 references
0.8732919
0 references
0.87219536
0 references
0.87085223
0 references
0.8566035
0 references
0 references
0.8512367
0 references
0.8493725
0 references
0.8484111
0 references
A near-linear time constant factor algorithm for unsplittable flow problem on line with bag constraints (English)
0 references
