Electric routing and concurrent flow cutting
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...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Published: |
Elsevier
2018
|
| Online Access: | http://hdl.handle.net/1721.1/115843 https://orcid.org/0000-0002-4257-4198 |