Tom Leighton, Fillia Makedon, Serge Plotkin, Eva Tardos, Spyros Tragoudas  Home/Search
Context Related
| cornell.edu/pub/techreps/TR1115.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: 128.227.36.67/InformsArc...papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: All previously known algorithms for solving the multicommodity flow problem with capacities are based on linear programming. The best of these algorithms [15] uses a fast matrix multiplication algorithm and takes O(k log(nDU )) time for the multicommodity flow problem with integer demands and at least O(k DU )) time to find an approximate solution, where k is the number of commodities, n and m denote the number of nodes and edges in the network, D is the largest demand, and ... (Update)
Cited by: More
Multicommodity Flow Approximation used for - Exact Graph Partitioning (Correct)
High Throughput Route Selection in Multi-Rate Ad Hoc.. - Awerbuch, Holmer, Rubens (2004) (Correct)
The Medium Time Metric: High Throughput Route Selection.. - Awerbuch, Holmer, Rubens (2004) (Correct)
Similar documents (at the sentence level):
78.5%: Fast Approximation Algorithms for Multicommodity Flow.. - Leighton, Makedon.. (1993) (Correct)
17.2%: Approximation Algorithms for Multicommodity Flow and Shop.. - Stein (1992) (Correct)
Active bibliography (related documents): More All
0.2: Exact and Approximation Algorithms for Network Flow and.. - Kolliopoulos (1998) (Correct)
0.1: Adding Multiple Cost Constraints to Combinatorial.. - Karger, Plotkin (1995) (Correct)
0.1: Multicommodity Flows and Approximation Algorithms - Garg (1994) (Correct)
Similar documents based on text: More All
0.6: Faster Approximation Algorithms for the Unit Capacity.. - Klein, Plotkin.. (1990) (Correct)
0.5: Improved Bounds on the Max-Flow Min-Cut Ratio for.. - Plotkin, Tardos (1993) (Correct)
0.5: Fast Approximation Algorithms for Fractional Packing and.. - Plotkin, Shmoys, Tardos (1995) (Correct)
Related documents from co-citation: More All
56: Fast approximation algorithms for fractional packing and covering problems - Plotkin, Shmoys et al. - 1991
53: Faster approximation algorithms for the unit capacity concurrent flow problem wi.. - Klein, Plotkin et al. - 1990
50: The maximum concurrent flow problem (context) - Matula, Shahrokhi - 1990
BibTeX entry: (Update)
T.Leighton, F.Makedon, S.Plotkin, C.Stein, E.Tardos, and S.Tragoudas. Fast approximation algorithms for multicommodity flow problems. In 25th Annual ACM Symposium on the Theory of Computing, pages 101--111, 1991. http://citeseer.ist.psu.edu/article/leighton92fast.html More
@inproceedings{ leighton91fast,
author = "Tom Leighton and Clifford Stein and Fillia Makedon and {\'E}va Tardos and Serge Plotkin and Spyros Tragoudas",
title = "Fast approximation algorithms for multicommodity flow problems",
pages = "101--111",
year = "1991",
url = "citeseer.ist.psu.edu/article/leighton92fast.html" }
Citations (may not include all citations):303 Princeton University Press (context) - Jr, Fulkerson et al. - 1956
168 An approximate max-flow min-cut theorem for uniform multicom.. (context) - Leighton, Rao - 1988
85 The maximum concurrent flow problem (context) - Shahrokhi, Matula - 1990
69 Faster approximation algorithms for the unit capacity concur.. - Klein, Plotkin et al. - 1991
61 Faster scaling algorithms for network problems (context) - Gabow, Tarjan - 1989
47 Speeding up linear programming using fast matrix multiplicat.. (context) - Vaidya - 1989
45 Approximation through multicommodity flow (context) - Klein, Agrawal et al. - 1990
38 Fast approximation schemes for convex programs with many blo.. (context) - Grigoriadis, Khachiyan - 1991
34 Solving minimum-cost flow problems by successive approximati.. (context) - Goldberg, Tarjan - 1990
30 Fast algorithms for convex quadratic programming and multico.. (context) - Kapoor, Vaidya - 1986
21 Approximation algorithms for multicommodity flow and schedul.. - Stein - 1992
17 Personal communication (context) - Goldberg - 1991
11 Finding minimum cost flows by double scaling (context) - Ahuja, Goldberg et al. - 1988
9 VLSI partitioning approximation algorithms based on multicom.. (context) - Tragoudas - 1991
3 A problem on minimum transportation cost (context) - Yakovleva - 1959
3 Approximating the minimum net expansion: Near optimal soluti.. (context) - Makedon, Tragoudas - 1990
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://128.227.36.67/InformsArchive/papers.html): More
A Faster Algorithm for the Quickest Transshipment Problem - Fleischer (1997) (Correct)
Notes on Median and Quantile Estimation with Applications - Huber (1998) (Correct)
A Performance Evaluation of Online Warehouse Update.. - Labrinidis, Roussopoulos (1998) (Correct)
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