Optimal Electrical Oblivious Routing on Expanders
Cella Florescu, Rasmus Kyng, Maximilian Probst Gutenberg, Sushant, Sachdeva

TL;DR
This paper analyzes the effectiveness of electrical flow routing as an oblivious routing scheme on expander graphs, providing tight bounds on its competitiveness across various norms and establishing its near-optimality.
Contribution
It proves that electrical routing is nearly optimal in multiple norms on expanders and offers a unified framework for bounds across different p and q norms.
Findings
Electrical routing is $O(rac{1}{\
Electrical routing is $O(\\log^2 m)$-competitive in the \\ell_2-norm.
Lower bounds match upper bounds, showing near-tightness of results.
Abstract
In this paper, we investigate the question of whether the electrical flow routing is a good oblivious routing scheme on an -edge graph that is a -expander, i.e. where for every . Beyond its simplicity and structural importance, this question is well-motivated by the current state-of-the-art of fast algorithms for oblivious routings that reduce to the expander-case which is in turn solved by electrical flow routing. Our main result proves that the electrical routing is an -competitive oblivious routing in the - and -norms. We further observe that the oblivious routing is -competitive in the -norm and, in fact, -competitive if -localization is …
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
