Electric routing and concurrent flow cutting
Name
Kelner_Electric Routing.pdf
Size
246.02 KB
Format
Adobe PDF
Checksum (MD5)
f0d73436b62e0fafc4e4209ad5d173fb
Author(s)
Adam, Jonathan Adam
Maymounkov, Petar Borissov
Date Issued
December 2009
Journal
Algorithms and Computation, Proceedings of the 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009
Publisher
Springer-Verlag
Citation
Kelner, Jonathan, and Petar Maymounkov. “Electric Routing and Concurrent Flow Cutting.” Algorithms and Computation. Ed. Yingfei Dong, Ding-Zhu Du, & Oscar Ibarra. (Lecture Notes in Computer Science ; Vol. 5878). Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. 792–801. Web.
Version
Author's final manuscript
Abstract
We investigate an oblivious routing scheme amenable to distributed computation and resilient to graph changes, based on electrical flow. Our main technical contribution is a new rounding method which we use to obtain a bound on the L[subscript 1]-->L[subscript 1] operator norm of the inverse graph Laplacian.
MIT Department
Massachusetts Institute of Technology. Department of Mathematics
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike 3.0
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/978-3-642-10631-6_80
