S. Muthukrishnan and T. Suel, "Second-order methods for distributed approximate single- and multicommodity flow," in Proc. RANDOM, pp. 369--383, 1998. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
I/O-Efficient Techniques for Computing Pagerank - Chen, Gan, Suel Self-citation (Suel) (Correct)
....in the literature [18] are not optimal for graphs that are only moderately larger than memory, and in fact our Split Accumulate Algorithm attempts to overcome this issue. We note that iterative processes very similar to Pagerank have, e.g. been proposed for various multicommodity flow problems [6, 27, 33], which could be solved in an I O e#cient way using the same techniques. Conversely, techniques based on network flow have also recently been used in the link based analysis of web pages [22] 5. ALGORITHMS We now describe the di#erent algorithms that we study in this paper. We begin with the ....
S. Muthukrishnan and T. Suel. Second-order methods for distributed approximate single- and multicommodity flow. In 2nd Int. Workshop on Randomization and Approximation Techniques in Computer Science, pages 369--383. Springer LNCS, 1998.
Maximum Lifetime Routing in Wireless Ad-hoc Networks - Sankar, Liu (2004) (1 citation) (Correct)
No context found.
S. Muthukrishnan and T. Suel, "Second-order methods for distributed approximate single- and multicommodity flow," in Proc. RANDOM, pp. 369--383, 1998.
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