|
Volumn , Issue , 1990, Pages 310-321
|
Leighton-Rao might be practical. Faster approximation algorithms for concurrent flow with uniform capacities
a a a |
Author keywords
[No Author keywords available]
|
Indexed keywords
COMPUTER PROGRAMMING--ALGORITHMS;
APPROXIMATION ALGORITHMS;
CONCURRENT FLOW;
MULTICOMMODITY FLOW PROBLEM;
RANDOMIZED ALGORITHMS;
MATHEMATICAL TECHNIQUES;
|
EID: 0025099221
PISSN: None
EISSN: None
Source Type: Conference Proceeding
DOI: 10.1145/100216.100257 Document Type: Conference Paper |
Times cited : (20)
|
References (13)
|