| K. Jansen and H. Zhang. An approximation algorithm for the multicast congestion problem via minimum Steiner trees. In 3rd International Workshop on Approximation and Randomized Algorithms in Communication Networks (ARANCE), Rome, Italy, 2002. |
.... version that is particularly simple to analyze is due to Garg and K onemann [3] Independently, similar results were given by Grigoriadis and Khachiyan [6] In two recent papers Jansen and Zhang extended the latter approach and discussed an application to the minimum multicast congestion problem [7], 8] In particular, they presented a randomized algorithm for approximating the minimum multicast congestion within O(OPT log n) in time O(m(ln m ln ) k m ln ln(m= where is the running time of an approximate block solver. The online version of the problem was considered by Aspnes ....
K. Jansen, H. Zhang, An approximation algorithm for the multicast congestion problem via minimum Steiner trees, In Proc. 3rd Int. Worksh. on Approx. and Random. Alg. in Commun. Netw. (ARANCE'02), Roma, Italy, September 21, 2002.
No context found.
K. Jansen and H. Zhang. An approximation algorithm for the multicast congestion problem via minimum Steiner trees. In 3rd International Workshop on Approximation and Randomized Algorithms in Communication Networks (ARANCE), Rome, Italy, 2002.
No context found.
K. Jansen and H. Zhang, "An approximation algorithm for the multicast congestion problem via minimum steiner trees," in Proc. 3rd International Workshop on Approximation and Randomized Algorithms in Communication Networks (ARANCE'02), Rome, Italy, Sept. 2002.
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