Efficient routing in all-optical networks
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
A new approach to the minimum cut problem
Journal of the ACM (JACM)
Efficient approximation algorithms for semidefinite programs arising from MAX CUT and COLORING
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
On-line routing of virtual circuits with applications to load balancing and machine scheduling
Journal of the ACM (JACM)
Randomized rounding without solving the linear program
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Fast approximation algorithm for minimum cost multicommodity flow
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Routing and admission control in general topology networks with Poisson arrivals
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Online througput-competitive algorithm for multicast routing and admission control
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
Journal of the ACM (JACM)
Faster approximation schemes for fractional multicommodity flow problems
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Bounds and Heuristics for the Shortest Capacitated Paths Problem
Journal of Heuristics
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
Experimental Evaluation of Approximation Algorithms for Single-Source Unsplittable Flow
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
Approximating Fractional Multicommodity Flow Independent of the Number of Commodities
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
A fast approximation scheme for fractional covering problems with variable upper bounds
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
An online throughput-competitive algorithm for multicast routing and admission control
Journal of Algorithms
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Multicommodity Flow Based Maximum Lifetime Routing in Wireless Sensor Network
ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 1
A combinatorial approximation algorithm for concurrent flow problem and its application
Computers and Operations Research
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Greedy distributed optimization of multi-commodity flows
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Faster approximation schemes for fractional multicommodity flow problems
ACM Transactions on Algorithms (TALG)
On the complexity of bandwidth allocation in radio networks
Theoretical Computer Science
Multicast Routing and Design of Sparse Connectors
Algorithmics of Large and Complex Networks
Proceedings of the ACM SIGOPS 22nd symposium on Operating systems principles
Pairwise data clustering and applications
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Fast approximation of minimum multicast congestion: implementation versus theory
CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
A nondifferentiable optimization approach to ratio-cut partitioning
WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
Proceedings of the forty-second ACM symposium on Theory of computing
$O(\sqrt{\logn})$ Approximation to SPARSEST CUT in $\tilde{O}(n^2)$ Time
SIAM Journal on Computing
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
Implementation of approximation algorithms for the multicast congestion problem
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Wavelength assignment to lightpaths for minimal wavelength conversions in multihop WDM networks
Computer Communications
Hi-index | 0.00 |
This paper describes new algorithms for approximately solving the concurrent multicommodity flow problem with uniform capacities. These algorithms are much faster than algorithms discovered previously. Besides being an important problem in its own right, the uniform-capacity concurrent flow problem has many interesting applications. Leighton and Rao used uniform-capacity concurrent flow to find an approximately "sparsest cut" in a graph and thereby approximately solve a wide variety of graph problems, including minimum feedback arc set, minimum cut linear arrangement, and minimum area layout. However, their method appeared to be impractical as it required solving a large linear program. This paper shows that their method might be practical by giving an $O(m^2 \log m)$ expected-time randomized algorithm for their concurrent flow problem on an $m$-edge graph. Raghavan and Thompson used uniform-capacity concurrent flow to solve approximately a channel width minimization problem in very large scale integration. An $O(k^{3/2} (m + n \log n))$ expected-time randomized algorithm and an $O(k\min{n,k} (m+n\log n)\log k)$ deterministic algorithm is given for this problem when the channel width is $\Omega(\log n)$, where $k$ denotes the number of wires to be routed in an $n$-node, $m$-edge network.