The maximum concurrent flow problem
Journal of the ACM (JACM)
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Approximation schemes for the restricted shortest path problem
Mathematics of Operations Research
Fast approximation algorithms for multicommodity flow problems
Selected papers of the 23rd annual ACM symposium on Theory of computing
Fast approximation algorithms for fractional packing and covering problems
Mathematics of Operations Research
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Cut problems and their application to divide-and-conquer
Approximation algorithms for NP-hard problems
Coordination complexity of parallel price-directive decomposition
Mathematics of Operations Research
Approximate minimum-cost multicommodity flows in O˜(&egr;-2KNM) time
Mathematical Programming: Series A and B
An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm
SIAM Journal on Computing
Randomized rounding without solving the linear program
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Fast deterministic approximation for the multicommodity flow problem
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Approximating Fractional Multicommodity Flow Independent of the Number of Commodities
SIAM Journal on Discrete Mathematics
Faster approximation schemes for fractional multicommodity flow problems
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Faster and Simpler Algorithms for Multicommodity Flow and other Fractional Packing Problems.
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Expander flows, geometric embeddings and graph partitioning
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
0(\sqrt {\log n)} Approximation to SPARSEST CUT in Õ(n2) Time
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
On minimizing average end-to-end delay in P2P live streaming systems
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Hi-index | 0.00 |
We present fully polynomial approximation schemes for concurrent multicommodity flow problems that run in time of the minimum possible dependencies on the number of commodities k. We show that by modifying the algorithms by Garg and Könemann [1998] and Fleischer [2000], we can reduce their running time on a graph with n vertices and m edges from Õ(ϵ−2(m2 + km)) to Õ(ϵ−2m2) for an implicit representation of the output, or Õ(ϵ−2(m2 + kn for an explicit representation, where Õ(f) denotes a quantity that is O(f logO(1)m). The implicit representation consists of a set of trees rooted at sources (there can be more than one tree per source), and with sinks as their leaves, together with flow values for the flow directed from the source to the sinks in a particular tree. Given this implicit representation, the approximate value of the concurrent flow is known, but if we want the explicit flow per commodity per edge, we would have to combine all these trees together, and the cost of doing so may be prohibitive. In case we want to calculate explicitly the solution flow, we modify our schemes so that they run in time polylogarithmic in nk (n is the number of nodes in the network). This is within a polylogarithmic factor of the trivial lower bound of time Ω(nk) needed to explicitly write down a multicommodity flow of k commodities in a network of n nodes. Therefore our schemes are within a polylogarithmic factor of the minimum possible dependencies of the running time on the number of commodities k.