A note on the greedy algorithm for the unsplittable flow problem (Q1028992)
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: A note on the greedy algorithm for the unsplittable flow problem |
scientific article; zbMATH DE number 5576878
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on the greedy algorithm for the unsplittable flow problem |
scientific article; zbMATH DE number 5576878 |
Statements
A note on the greedy algorithm for the unsplittable flow problem (English)
0 references
9 July 2009
0 references
approximation algorithms
0 references
graph algorithms
0 references
0 references
0.8655269742012024
0 references
0.8618177175521851
0 references
0.8273268342018127
0 references
0.8243272304534912
0 references
