T. Leighton, F. Makedon, S. Plotkin, C. Stein, E. Tardos, and S. Tragoudas. Fast Approximation Algorithms for Multicommodity Flow Problems. Journal of Computer and System Sciences, 50(2):228--243, 1995. Home/Search Document Details and Download
Summary ACM TOC Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Fast Approximation of Minimum Multicast Congestion -.. - Baltz, Srivastav (Correct)
....more general fractional packing and covering problems. Matula and Shahrokhi [11] were the rst who developed a combinatorial strongly polynomial approximation algorithm for the uniform concurrent ow problem. Their method was subsequently generalized and improved by Goldberg [4] Leighton et al. [10], Klein et al. 9] Plotkin et al. 13] and Radzik [14] A fast version that is particularly simple to analyze is due to Garg and K onemann [3] Independently, similar results were given by Grigoriadis and Khachiyan [6] In two recent papers Jansen and Zhang extended the latter approach and ....
T. Leighton, F. Makedon, S. Plotkin, C. Stein, E. Tardos, S. Tragoudas, Fast approximation algorithms for multicommodity ow problems, J. of Comp. and System Sciences 50, 228-243, 1995.
Approximation algorithms for semidefinite packing.. - Iyengar, Phillips, Stein (2004) Self-citation (Stein) (Correct)
No context found.
T. Leighton, F. Makedon, S. Plotkin, C. Stein, E. Tardos, and S. Tragoudas. Fast approximation algorithms for multicommodity flow problems. Journal of Computer and System Sciences, 50:228--243, 1995.
Experimental Evaluation of Approximation Algorithms for.. - Kolliopoulos, Stein (1999) Self-citation (Stein) (Correct)
No context found.
T. Leighton, F. Makedon, S. Plotkin, C. Stein, ' E. Tardos, and S. Tragoudas. Fast approximation algorithms for multicommodity flow problems. Journal of Computer and System Sciences, 50:228--243, 1995.
Approximation Algorithms for Single-Source Unsplittable Flow - Kolliopoulos, Stein (1997) (2 citations) Self-citation (Stein) (Correct)
No context found.
T. Leighton, F. Makedon, S. Plotkin, C. Stein, E. Tardos, and S. Tragoudas, Fast approximation algorithms for multicommodity ow problems, Journal of Computer and System Sciences, 50 (1995), pp. 228-243.
An Implementation of a Combinatorial Approximation.. - Goldberg, Oldham.. (1997) (20 citations) Self-citation (Plotkin Stein) (Correct)
No context found.
Tom Leighton, Fillia Makedon, Serge Plotkin, Clifford Stein, ' Eva Tardos, and Spyros Tragoudas. Fast approximation algorithms for multicommodity flow problems. Journal of Computer and System Sciences, 50(2):228--243, April 1995.
Exact and Approximation Algorithms for Network Flow and.. - Kolliopoulos (1998) (2 citations) Self-citation (Makedon Stein) (Correct)
No context found.
T. Leighton, F. Makedon, S. Plotkin, C. Stein, E. Tardos, and S. Tragoudas. Fast approximation algorithms for multicommodity flow problems. Journal of Computer and System Sciences, 50:228--243, 1995.
An Implementation of a Combinatorial Approximation.. - Goldberg, Oldham.. (1997) (20 citations) Self-citation (Plotkin Stein) (Correct)
No context found.
Tom Leighton, Fillia Makedon, Serge Plotkin, Clifford Stein, ' Eva Tardos, and Spyros Tragoudas. Fast approximation algorithms for multicommodity flow problems. Journal of Computer and System Sciences, 50(2):228--243, April 1995.
Multicommodity Flow Approximation used for - Exact Graph Partitioning (Correct)
No context found.
T. Leighton, F. Makedon, S. Plotkin, C. Stein, E. Tardos, and S. Tragoudas. Fast Approximation Algorithms for Multicommodity Flow Problems. Journal of Computer and System Sciences, 50(2):228--243, 1995.
Multicommodity Flow Approximation used for - Exact Graph Partitioning (2003) (Correct)
No context found.
T. Leighton, F. Makedon, S. Plotkin, C. Stein, E. Tardos, and S. Tragoudas. Fast Approximation Algorithms for Multicommodity Flow Problems. Journal of Computer and System Sciences, 50(2):228--243, 1995.
High Throughput Route Selection in Multi-Rate Ad Hoc.. - Awerbuch, Holmer, Rubens (2004) (6 citations) (Correct)
No context found.
T. Leighton, F. Makedon, S. Plotkin, C. Stein, E. Tardos, and S. Tragoudas, "Fast approximation algorithms for multicommodity flow problem," in Proc. 23rd ACM Symp. on Theory of Computing, May 1991, pp. 101--111.
The Medium Time Metric: High Throughput Route Selection.. - Awerbuch, Holmer, Rubens (2004) (Correct)
No context found.
T. Leighton, F. Makedon, S. Plotkin, C. Stein, E. Tardos, and S. Tragoudas, "Fast approximation algorithms for multicommodity flow problem," in Proc. 23rd ACM Symp. on Theory of Computing, pp. 101--111, May 1991.
A Scalable Algorithm for the Minimum Expected Cost.. - Lisa Fleischer Adam (Correct)
No context found.
T. Leighton, F. Makedon, S. Plotkin, C. Stein, E. Tardos, and S. Tragoudas. Fast approximation algorithms for multicommodity ow problems. Journal of Computer and System Sciences, 50:228-243, 1995.
On the Number of Iterations for Dantzig-Wolfe Optimization and .. - Klein, Young (2002) (6 citations) (Correct)
No context found.
T. Leighton, F. Makedon, S. Plotkin, C. Stein, E. Tardos, and S. Tragoudas. Fast approximation algorithms for multicommodity flow problems. Journal of Computer and System Sciences, 50(2):228, 1995.
Faster Approximation Algorithms for Packing and Covering.. - Bienstock, Iyengar (2004) (Correct)
No context found.
T. Leighton, F. Makedon, S. Plotkin, C. Stein, E. Tardos and S. Tragoudas. Fast approximation algorithms for multicommodity flow problems, Proc. 23nd Ann. ACM Symp. on Theory of Computing, 101-111, 1999.
Approximating Fractional Multicommodity Flow Independent of the.. - Fleischer (1999) (27 citations) (Correct)
No context found.
T. Leighton, F. Makedon, S. Plotkin, C. Stein, ' E. Tardos, and S. Tragoudas. Fast approximation algorithms for multicommodity flow problems. Journal of Computer and System Sciences, 50:228--243, 1995. 12
Asymptotic Analysis of the Flow Deviation Method for the.. - Bienstock, Raskina (2000) (Correct)
No context found.
T. Leighton, F. Makedon, S. Plotkin, C. Stein, E. Tardos and S. Tragoudas, Fast approximation algorithms for multicommodity ow problems, Proc. 23nd Ann. ACM Symp. on Theory of Computing (1991), 101-111.
Concurrent Flows in O*(1/ε) iterations - Bienstock, Iyengar (2004) (Correct)
No context found.
T. Leighton, F. Makedon, S. Plotkin, C. Stein, E. Tardos and S. Tragoudas, Fast approximation algorithms for multicommodity flow problems, Proc. 23nd Ann. ACM Symp. on Theory of Computing (1991), 101-111.
Approximation Algorithms for Treewidth - Amir (Correct)
No context found.
T. Leighton, F. M. S. Plotkin, C. Stein, E. Tardos, and S. Tragoudas, Fast approximation algorithms for multicommodity flow problems, Journal of Computer and System Sciences, 50 (1995), pp. 228--243.
Application-oriented Self-organizing Hierarchical.. - Richa, Obraczka, Sen (Correct)
No context found.
T. Leighton, F. Makedon, S. Plotkin, C. Stein, E. Tardos and S. Tragoudas. Fast approximation algorithms for multicommodity ow problems. Journal of Computer and System Science, 50, pages 228-243, 1995.
High Throughput Route Selection in Multi-Rate Ad Hoc.. - Awerbuch, Holmer, Rubens (2004) (6 citations) (Correct)
No context found.
T. Leighton, F. Makedon, S. Plotkin, C. Stein, E. Tardos, and S. Tragoudas, "Fast approximation algorithms for multicommodity flow problem," in Proc. 23rd ACM Symp. on Theory of Computing, May 1991, pp. 101--111.
Second-Order Methods for Distributed Approximate Single-.. - Muthukrishnan, Suel (1998) (1 citation) (Correct)
No context found.
T. Leighton, F. Makedon, S. Plotkin, C. Stein, E. Tardos and S. Tragoudas. Fast approximation algorithms for multicommodity flow problems. Proc. 24th ACM STOC, 101-111, 1991.
Faster and Simpler Algorithms for Multicommodity Flow and.. - Garg, Könemann (1997) (64 citations) (Correct)
No context found.
T. Leighton, F. Makedon, S. Plotkin, C. Stein, S. Tragoudas, and E. Tardos. Fast approximation algorithms for multicommodity flow problems. J. Comput. System Sci., 50:228--243, 1995.
Approximation Algorithms for Disjoint Paths Problems - Kleinberg (1996) (62 citations) (Correct)
No context found.
F.T. Leighton, F. Makedon, S. Plotkin, C. Stein, ' E. Tardos, S. Tragoudas, "Fast approximation algorithms for the multicommodity flow problem," Proc. 23rd ACM Symp. on Theory of Computing, 1991, pp. 101--111.
Lagrangian Relaxation Based Algorithms for Convex Programming.. - Khandekar (2004) (Correct)
No context found.
T. Leighton, F. Makedon, S. Plotkin, C. Stein, S. Tragoudas, and E. Tardos. Fast approximation algorithms for multicommodity flow problems. J. Comput. System Sci., 50(2):228--243, 1995.
On-line Network Routing - Leonardi (1998) (19 citations) (Correct)
No context found.
T. Leighton, F. Makedon, S. Plotkin, C. Stein, E. Tardos, and S. Tragoudas. Fast approximation algorithms for multicommodity flow problems. In Proceedings of the 23rd ACM Symposium on Theory of Computing, pages 101--111, 1991.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC