| dc.contributor.author | Kelner, Jonathan Adam | |
| dc.contributor.author | Maymounkov, Petar Borissov | |
| dc.date.accessioned | 2018-05-24T15:45:24Z | |
| dc.date.available | 2018-05-24T15:45:24Z | |
| dc.date.issued | 2010-06 | |
| dc.identifier.issn | 0304-3975 | |
| dc.identifier.uri | http://hdl.handle.net/1721.1/115843 | |
| dc.description.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 operator norm of the inverse graph Laplacian. We show how this norm reflects both latency and congestion of electric routing. Keywords: Oblivious routing; Spectral graph theory; Laplacian operator | en_US |
| dc.publisher | Elsevier | en_US |
| dc.relation.isversionof | http://dx.doi.org/10.1016/j.tcs.2010.06.013 | en_US |
| dc.rights | Creative Commons Attribution-Noncommercial-Share Alike | en_US |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-sa/4.0/ | en_US |
| dc.source | arXiv | en_US |
| dc.title | Electric routing and concurrent flow cutting | en_US |
| dc.type | Article | en_US |
| dc.identifier.citation | Kelner, Jonathan and Petar Maymounkov. “Electric Routing and Concurrent Flow Cutting.” Theoretical Computer Science 412, 32 (July 2011): 4123–4135 © 2010 Elsevier B.V. | en_US |
| dc.contributor.department | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory | en_US |
| dc.contributor.mitauthor | Kelner, Jonathan Adam | |
| dc.contributor.mitauthor | Maymounkov, Petar Borissov | |
| dc.relation.journal | Theoretical Computer Science | en_US |
| dc.eprint.version | Original manuscript | en_US |
| dc.type.uri | http://purl.org/eprint/type/JournalArticle | en_US |
| eprint.status | http://purl.org/eprint/status/NonPeerReviewed | en_US |
| dc.date.updated | 2018-05-24T13:30:35Z | |
| dspace.orderedauthors | Kelner, Jonathan; Maymounkov, Petar | en_US |
| dspace.embargo.terms | N | en_US |
| dc.identifier.orcid | https://orcid.org/0000-0002-4257-4198 | |
| mit.license | OPEN_ACCESS_POLICY | en_US |
