ABSTRACT
No abstract available.
- B. Awerbuch and F. Leighton. A simple local-control approximation algorithm for multicommodity flow. In Proc. of the 34th IEEE Symp. on Foundations of Computer Science (FOCS), pages 459-468, 1993.Google ScholarDigital Library
- P. Erdos and A. Renyi. On the evolution of random graphs. Publ. Math. Inst. Hungar. Acad. Sci., 5, 1960.Google Scholar
Index Terms
- A multicommodity flow model for distributed stream processing
Recommendations
A multicommodity flow model for distributed stream processing
Performance evaluation reviewDistributed algorithms for multicommodity flow problems via approximate steepest descent framework
We consider solutions for distributed multicommodity flow problems, which are solved by multiple agents operating in a cooperative but uncoordinated manner. We show first distributed solutions that allow (1 + ϵ) approximation and whose convergence time ...
A randomized rounding approach to a k-splittable multicommodity flow problem with lower path flow bounds affording solution quality guarantees
In 2005, Baier et al. introduced a "k-splittable" variant of the multicommodity flow (MCF) problem in which a given commodity was allowed to flow through a number of paths limited by a small integer. This problem enables a better use of the link ...
Comments