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 L[subscript 1]-->L[subscript 1] operator norm of the inverse grap...
| Main Authors: | , |
|---|---|
| Other Authors: | , |
| Format: | Article |
| Language: | English |
| Published: |
Springer-Verlag,
2012-07-12T19:19:55Z.
|
| Subjects: | |
| Online Access: | Get fulltext |