Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
Journal of the ACM (JACM)
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Journal of the ACM (JACM)
New lower bounds for oblivious routing in undirected graphs
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
On space-stretch trade-offs: lower bounds
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Minimizing average latency in oblivious routing
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Optimal hierarchical decompositions for congestion minimization in networks
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Graph sparsification by effective resistances
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Noise Tolerance of Expanders and Sublinear Expander Reconstruction
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Expanders via random spanning trees
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
A simple, combinatorial algorithm for solving SDD systems in nearly-linear time
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 5.23 |
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 @?"1-@?"1 operator norm of the inverse graph Laplacian. We show how this norm reflects both latency and congestion of electric routing.