T. Leighton and S. Rao. An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms. In 29th Annual Symposium on the Foundations of Computer Science, pages 422--431. IEEE Computer Society, October 1988. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
The Permutation-Path Coloring Problem on Trees - Dominique Barth Sylvie (2000) (Correct)
....This paper is concerned with the routing permutations on trees by arc disjoint paths, that is, the path coloring problem on trees when the collection of connection requests represents a permutation of the nodes of the tree network. Previous and related work. Using a result of Leighton and Rao [19], Aumann and Rabani [1] have shown that O( log 2 ) colors suffices for routing any permutation on any bounded degree network on n nodes, where fi is the arc expansion of the network. The result of Aumman and Rabani almost matches the existential lower bound of Omega Gamma 2 ) obtained by ....
F. T. Leighton, S. Rao. An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms. In Proc. of 29th IEEE FOCS, pp 422-431, 1988.
Compact Representations of Separable Graphs - Blandford, Blelloch, Kash (2003) (3 citations) (Correct)
....so that all vertices have constant in degree. The time to construct our representation depends on the time needed to recursively separate the graph (all other aspects take linear time) A polylogarithmic approximation of the separator size is su#cient for our bounds so the Leighton Rao separator [15] gives a polynomial time construction for graphs satisfying an O(n ) c 1 edge separator theorem. For special graphs more e#cient solutions are known, e.g. for planar graphs [17] and well shaped meshes [19] In practice fast heuristics work well for most graphs [13] We implemented a ....
F. T. Leighton and S. Rao. An approximate maxflow min-cut theorem for uniform multicommodity flow problems, with applications to approximation algorithms. In FOCS, pages 422--431, 1988.
A Tight Bound on Approximating Arbitrary Metrics by Tree.. - Fakcharoenphol, Rao.. (2003) (14 citations) Self-citation (Rao) (Correct)
No context found.
T. Leighton and S. Rao. An approximate max-flow min-cut theorem for uniform multicommodity flow problems with application to approximation algorithms. In IEEE Symposium on Foundations of Computer Science, pages 422--431, 1988.
A Bibliography for the Approximation Algorithms Minicourse - Williamson (1995) Self-citation (Leighton Rao) (Correct)
No context found.
T. Leighton and S. Rao. An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms. In Proceedings of the 29th Annual Symposium on Foundations of Computer Science, pages 422--431, 1988.
Fast Approximation Algorithms for Multicommodity Flow.. - Leighton, Makedon.. (1992) (74 citations) Self-citation (Leighton) (Correct)
....are increased by a (1 ffl) factor, or to provide a proof that there is no feasible solution to the original problem. We also describe faster approximation algorithms for multicommodity flow problems with a special structure, such as those that arise in the sparsest cut problems studied in [8, 10, 9], and the uniform concurrent flow problems studied in [12, 9] if k m. 1 Introduction The multicommodity flow problem involves simultaneously shipping several different commodities from their respective sources to their sinks in a single network so that the total amount of flow going through ....
....polynomially on ffl . The deterministic algorithm runs in time proportional to ffl and the randomized one runs in time proportional to . Goldberg [4] and Grigoriadis and Khachiyan [6] have shown how to improve the dependence on ffl of the randomized algorithm to ffl . Leighton and Rao [10] have shown how to use an approximately optimal solution to a concurrent flow problem to find an approximately sparsest cut in a graph. The sparsity of a cut is defined to be the ratio of the number of edges crossing the cut to the product number of nodes on the two sides of the cut. As a ....
[Article contains additional citation context not shown here]
T. Leighton and S. Rao. An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms. In Proceedings of the 29th Annual Symposium on Foundations of Computer Science, pages 422--431, 1988.
On the Performance of Spectral Graph Partitioning Methods - Stephen Guattery Gary (Correct)
No context found.
T. Leighton and S. Rao. An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms. In 29th Annual Symposium on the Foundations of Computer Science, pages 422--431. IEEE Computer Society, October 1988.
Simultaneous Source Location - Konstantin Andreev Charles (Correct)
No context found.
T. Leighton, S. Rao. An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms Proceedings of the 29th Symp. on Foundations of Computer Science, 1988
Compact Representations of Separable Graphs - Daniel Blandford Guy (2003) (3 citations) (Correct)
No context found.
F. T. Leighton and S. Rao. An approximate maxflow min-cut theorem for uniform multicommodity flow problems, with applications to approximation algorithms. In FOCS, pages 422--431, 1988.
Compact Data Structures with Fast Queries - Blandford (2005) (Correct)
No context found.
F. T. Leighton and S. Rao. An approximate max-flow min-cut theorem for uniform multicommodity flow problems, with applications to approximation algorithms. In FOCS, pages 422--431, 1988.
Spectral Partitioning Works:Planar graphs and finite element.. - Spielman, Teng (1996) (34 citations) (Correct)
No context found.
F. T. Leighton and S. Rao. An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms. In 29th Annual Symposium on Foundations of Computer Science, pages 422--431, 1988.
Hardness of the Undirected Edge-Disjoint Paths Problem - Andrews, Zhang (2005) (Correct)
No context found.
T. Leighton and S. Rao. An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms. In Proceedings of the 29th Annual Symposium on Foundations of Computer Science, pages 422 -- 431, 1988.
Faster Approximation Algorithms for the Unit Capacity.. - Klein, Plotkin, al. (1991) (44 citations) (Correct)
No context found.
T. Leighton and S. Rao. An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms. In Proceedings of the 29th Annual Symposium on Foundations of Computer Science, pages 422--431, 1988.
Efficient Collective Communication in Optical Networks - Bermond, Gargano.. (35 citations) (Correct)
No context found.
F. T. Leighton and S. Rao, "An Approximate Max-Flow Min-Cut Theorem for Uniform Multicommodity Flow Problems with Applications to Approximation Algorithms", in: Proceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science (FOCS'88), (1988), 422--431.
Approximating Fractional Multicommodity Flow Independent of the.. - Fleischer (1999) (27 citations) (Correct)
No context found.
T. Leighton and S. Rao. An approximate max-flow min-cut theorem for uniform multicommodity flow problems with application to approximation algorithms. In 29th Annual IEEE Symposium on Foundations of Computer Science, pages 422--431, 1988.
Approximation Algorithms for Treewidth - Amir (Correct)
No context found.
T. Leighton and S. Rao, An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms, in Proc. 29th IEEE Symp. on Foundations of Computer Science (FOCS'88), 1988, pp. 422--431.
Visual Clustering of Graphs with Nonuniform Degrees - Noack (2004) (1 citation) (Correct)
No context found.
Tom Leighton and Satish Rao. An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms. In Proceedings of the 29th Annual Symposium on Foundations of Computer Science (FOCS 1988), pages 422--431, 1988.
The Effect of Faults on Network Expansion - Bagchi, Bhargava, Chaudhary.. (2004) (1 citation) (Correct)
No context found.
T. Leighton and S. Rao. An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms. In 29th Annual Symposium on Foundations of Computer Science, pages 422--431, 1988.
Correlation Clustering - Minimizing Disagreements on Arbitrary .. - Emanuel, Fiat (2003) (4 citations) (Correct)
No context found.
Tom Leighton and S. Rao. An approximate max-flow mincut theorem for uniform multicommodity flow problems with applications to approximation algorithms. In Proc. of the 29 IEEE Symp. on Foundations of Computer Science (FOCS), pages 422--431, 1988.
Approximating Minimum Feedback Sets and Multicuts in.. - Even, Naor, Schieber.. (1998) (37 citations) (Correct)
No context found.
T. Leighton and S. Rao, An approximate max-flow min-cut theorem for uniform multi-commodity flow problems with applications to approximation algorithms, Proc. of the 29th IEEE Symposium on Foundations of Computer Science, pp. 422--431, 1988. Directed graphs are dealt with in manuscript, Feb. 1992.
The Effect of Faults on Network Expansion - Bagchi, Bhargava, Chaudhary.. (2004) (1 citation) (Correct)
No context found.
T. Leighton and S. Rao. An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms. In 29th Annual Symposium on Foundations of Computer Science, pages 422--431, 1988.
Experimental Evaluation of Approximation Algorithms for.. - Kolliopoulos, Stein (1999) (Correct)
No context found.
T. Leighton and S. Rao. An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms. In Proc. of the 29th Annual Symposium on Foundations of Computer Science, 422-- 431, 1988.
Exact and Approximation Algorithms for Network Flow and.. - Kolliopoulos (1998) (2 citations) (Correct)
No context found.
T. Leighton and S. Rao. An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms. In Proceedings of the 29th Annual Symposium on Foundations of Computer Science, pages 422--431, 1988.
Unknown - (Correct)
No context found.
T. Leighton and S. Rao. An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms. In Proceedings of the 29th Annual Symposium on Foundations of Computer Science, pages 422--431, 1988.
Lagrangian Relaxation Based Algorithms for Convex Programming.. - Khandekar (2004) (Correct)
No context found.
F. Leighton and S. Rao. An approximate max-flow min-cut theorem for uniform multicommodity flow problems with application to approximation algorithms. In Proceedings, IEEE Symposium on Foundations of Computer Science, pages 422--431, 1988.
Enhancing Techniques in LP Based Approximation Algorithms - Jain (Correct)
No context found.
T. Leighton and S. Rao. An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms. In Proc. 29th Ann. IEEE Symp. on Foundations of Comput. Sci., pages 422--431, 1988.
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