A simple local-control approximation algorithm for multicommodity flow
- 30 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 459-468
- https://doi.org/10.1109/sfcs.1993.366841
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- Approximation through multicommodity flowPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Approximate load balancing on dynamic and asynchronous networksPublished by Association for Computing Machinery (ACM) ,1993
- Fast approximation algorithms for multicommodity flow problemsPublished by Association for Computing Machinery (ACM) ,1991
- Finding Minimum-Cost Circulations by Successive ApproximationMathematics of Operations Research, 1990
- Speeding-up linear programming using fast matrix multiplicationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithmsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1988
- Distributed Solution of Network Programming ProblemsIEEE Transactions on Communications, 1964