Fast algorithms for convex quadratic programming and multicommodity flows
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
A new approach to the maximum-flow problem
Journal of the ACM (JACM)
The maximum concurrent flow problem
Journal of the ACM (JACM)
Finding minimum-cost circulations by successive approximation
Mathematics of Operations Research
Fast approximation algorithms for multicommodity flow problems
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Fast approximation algorithms for fractional packing and covering problems
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Approximation algorithms for multicommodity flow and shop scheduling problems
Approximation algorithms for multicommodity flow and shop scheduling problems
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Fast deterministic approximation for the multicommodity flow problem
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
I/O-efficient techniques for computing pagerank
Proceedings of the eleventh international conference on Information and knowledge management
Minimizing Stall Time in Single and Parallel Disk Systems Using Multicommodity Network Flows
APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
An Augmented Lagrangian Algorithm for Large Scale Multicommodity Routing
Computational Optimization and Applications
| Hi-index | 0.00 |