Author:
Baltz Andreas,Srivastav Anand
Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. J. Aspnes, Y. Azar, A. Fiat, S. Plotkin, O. Waarts, On-line routing of virtual circuits with applications to load balancing and machine scheduling, J. of the Association for Computing Machinery 44(3), 486–504, 1997.
2. R. Carr, S. Vempala, Randomized Metarounding, Proc. of the 32nd ACM Symposium on the theory of computing (STOC’ 00), Portland, USA, 58–62, 2000
3. N. Garg, J. Könemann, Faster and Simpler Algorithms for Multicommodity Flow and other Fractional Packing Problems. In Proc. 39th IEEE Annual Symposium on Foundations of Computer Science, 1998.
4. A.V. Goldberg, A natural randomization strategy for multicommodity flow and related algorithms, Information Processing Letters 42, 249–256, 1992.
5. A.V. Goldberg, A.D. Oldham, S. Plotkin, C. Stein, An Implementation of a Combinatorial Approximation Algorithm for Minimum-Cost Multicommodity Flows. In Proc. 6th Conf. on Integer Prog. and Combinatorial Optimization, 1998.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献