{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:32:52Z","timestamp":1725485572232},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540651420"},{"type":"electronic","value":"9783540495437"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/3-540-49543-6_29","type":"book-chapter","created":{"date-parts":[[2007,6,7]],"date-time":"2007-06-07T02:58:05Z","timestamp":1181185085000},"page":"369-384","source":"Crossref","is-referenced-by-count":2,"title":["Second-Order Methods for Distributed Approximate Single- and Multicommodity Flow"],"prefix":"10.1007","author":[{"given":"S.","family":"Muthukrishnan","sequence":"first","affiliation":[]},{"given":"Torsten","family":"Suel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[1999,6,11]]},"reference":[{"key":"29_CR1","doi-asserted-by":"crossref","unstructured":"O. Axelsson. Iterative Solution Methods. Cambridge University Press, 1994.","DOI":"10.1017\/CBO9780511624100"},{"key":"29_CR2","unstructured":"B. Awerbuch, Y. Azar and Y. Bartal. Local multicast rate control with globally optimum throughput. Manuscript, 1997."},{"key":"29_CR3","doi-asserted-by":"crossref","unstructured":"W. Aiello, B. Awerbuch, B. Maggs, and S. Rao. Approximate load balancing on dynamic and asynchronous networks. Proc. of 25th ACM Symp. on Theory of Computing, 632\u2013641, 1993.","DOI":"10.1145\/167088.167250"},{"key":"29_CR4","doi-asserted-by":"crossref","unstructured":"W. Aiello, E. Kushilevitz, R. Ostrovsky, and A. Rosen. Adaptive packet routing for bursty adversarial traffic. Proc. ACM STOC, 1998.","DOI":"10.1145\/276698.276788"},{"key":"29_CR5","doi-asserted-by":"crossref","unstructured":"B. Awerbuch and T. Leighton. A simple local-control approximation algorithm for multicommodity flow. Proc. 34th IEEE FOCS, 459\u2013468, 1993.","DOI":"10.1109\/SFCS.1993.366841"},{"key":"29_CR6","doi-asserted-by":"crossref","unstructured":"B. Awerbuch and T. Leighton. Improved approximation algorithms for the multicommodity flow problem and local competitive routing in dynamic networks. Proc. 26th ACM Symp. on Theory of Computing, 487\u2013496, 1994.","DOI":"10.1145\/195058.195238"},{"key":"29_CR7","doi-asserted-by":"crossref","unstructured":"B. Awerbuch, Y. Mansour and N. Shavit. End-to-end communication with polynomial overhead. Proc. 30th IEEE FOCS, 358\u2013363, 1989.","DOI":"10.1109\/SFCS.1989.63503"},{"key":"29_CR8","volume-title":"Templates for the solution of linear systems: Building blocks for iterative methods","author":"R. Barrett","year":"1993","unstructured":"R. Barrett, M. Berry, T. Chan, J. Demmel, J. Donato, J. Dongarra, V. Eijkhout, R. Pozo, C. Romine and H. van der Vorst. Templates for the solution of linear systems: Building blocks for iterative methods, SIAM, Philadelphia, Penn, 1993. http:\/\/netlib2.cs.utk.edu\/linalg\/html templates\/Templates.html ."},{"key":"29_CR9","unstructured":"D. Bertsekas and R. Gallagher. Data Networks. Prentice-Hall Publ. 1991."},{"key":"29_CR10","unstructured":"D. Bertsekas and J. Tsitsiklis. Parallel and Distributed Computation: NumericalMethods. Prentice Hall, 1989."},{"key":"29_CR11","doi-asserted-by":"crossref","unstructured":"F. Chung. Spectral Graph Theory, Chapter 8, CBMS Regional conference series in Mathematics, 1997.","DOI":"10.1090\/cbms\/092"},{"key":"29_CR12","doi-asserted-by":"crossref","unstructured":"G. Cybenko. Dynamic load balancing for distributed memory multiprocessors. Journal of Parallel and Distributed Computing, 279\u2013301, 1989.","DOI":"10.1016\/0743-7315(89)90021-X"},{"key":"29_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/3-540-63138-0_11","volume-title":"Proc. IRREGULAR 97","author":"R. Diekmann","year":"1997","unstructured":"R. Diekmann, S. Muthukrishnan and M. Nayakkankuppam. Engineering diffusive load balancing algorithms using experiments. Proc. IRREGULAR 97, LNCS Vol 1253, 111\u2013122, 1997."},{"key":"29_CR14","doi-asserted-by":"crossref","unstructured":"A. Goldberg and S. Rao. Beyond the Flow Decomposition Barrier. Proc. 38th IEEE FOCS, 1997.","DOI":"10.1109\/SFCS.1997.646087"},{"key":"29_CR15","doi-asserted-by":"crossref","unstructured":"A. Goldberg and R. Tarjan. A new approach to the maximum flow problem. Journal of the ACM, 1988, 921\u2013940.","DOI":"10.1145\/48014.61051"},{"key":"29_CR16","volume-title":"Applied Iterative Methods","author":"L. A. Hageman","year":"1981","unstructured":"L. A. Hageman and D. M. Young. Applied Iterative Methods. Academic Press, New York, 1981."},{"key":"29_CR17","doi-asserted-by":"crossref","unstructured":"D. Karger. Using random sampling to find maximum flows in uncapacitated undirected graphs. Proc. 30th ACM STOC, 1997.","DOI":"10.1145\/258533.258596"},{"key":"29_CR18","doi-asserted-by":"crossref","unstructured":"T. Leighton, F. Makedon, S. Plotkin, C. Stein, E. Tardos and S. Tragoudas. Fast approximation algorithms for multicommodity flow problems. Proc. 24th ACM STOC, 101\u2013111, 1991.","DOI":"10.1145\/103418.103425"},{"key":"29_CR19","doi-asserted-by":"crossref","unstructured":"T. Leong, P. Shor and C. Stein. Implementation of a Combinatorial Multicommodity Flow Algorithm. First DIMACS Implementation Challenge: Network Flows and Matchings, 1993.","DOI":"10.1090\/dimacs\/012\/15"},{"key":"29_CR20","doi-asserted-by":"crossref","unstructured":"L. Lovasz and P. Winkler. Mixing of random walks and other diffusions on a graph. Technical Report, Yale University, 1995.","DOI":"10.1017\/CBO9780511662096.007"},{"key":"29_CR21","doi-asserted-by":"crossref","unstructured":"S. Muthukrishnan and R. Rajaraman. An adversarial model for distributed dynamic load balancing. Proc. 10th ACM SPAA, 1998.","DOI":"10.1145\/277651.277669"},{"key":"29_CR22","doi-asserted-by":"crossref","unstructured":"S. Muthukrishnan, B. Ghosh, and M. Schultz. First-and second-order diffusive methods for rapid, coarse, distributed load balancing. To appear in Theory of Computing Systems, 1998. Special issue on ACM SPAA 96.","DOI":"10.1007\/s002240000092"},{"key":"29_CR23","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1145\/77600.77620","volume":"37","author":"F. Shahrokhi","year":"1990","unstructured":"F. Shahrokhi and D. Matula. The maximum concurrent flow problem. Journal of the ACM, 37:318\u2013334, 1990.","journal-title":"Journal of the ACM"},{"key":"29_CR24","unstructured":"A. Sinclair. Personal communication, 1998."},{"key":"29_CR25","doi-asserted-by":"crossref","unstructured":"P. Vaidya. Speeding up linear programming using fast matrix multiplication. Proc. 30th IEEE FOCS, 332\u2013337, 1989.","DOI":"10.1109\/SFCS.1989.63499"},{"key":"29_CR26","volume-title":"Matrix Iterative Analysis","author":"R. Varga","year":"1962","unstructured":"R. Varga. Matrix Iterative Analysis. Prentice-Hall, Englewood Cliffs, NJ, 1962."}],"container-title":["Lecture Notes in Computer Science","Randomization and Approximation Techniques in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-49543-6_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,22]],"date-time":"2020-04-22T20:37:18Z","timestamp":1587587838000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-49543-6_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540651420","9783540495437"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-49543-6_29","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1998]]}}}