The maximum concurrent flow problem
Journal of the ACM (JACM)
A natural randomization strategy for multicommodity flow and related algorithms
Information Processing Letters
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Fast approximation algorithms for multicommodity flow problems
Selected papers of the 23rd annual ACM symposium on Theory of computing
Fast approximation algorithms for fractional packing and covering problems
Mathematics of Operations Research
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Randomized rounding without solving the linear program
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Fast deterministic approximation for the multicommodity flow problem
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Faster and Simpler Algorithms for Multicommodity Flow and other Fractional Packing Problems.
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
A simple local-control approximation algorithm for multicommodity flow
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
Feasible and accurate algorithms for covering semidefinite programs
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Content placement via the exponential potential function method
IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization
A new approach to computing maximum flows using electrical flows
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |