2026-07-22T13:25:24Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:19583 2024-03-06T11:04:23Z ddc:004 open_access

Electrical Flows for Polylogarithmic Competitive Oblivious Routing Goranci, Gramoz Henzinger, Monika Räcke, Harald Sachdeva, Sushant Sricharan, A. R. oblivious routing electrical flows Oblivious routing is a well-studied paradigm that uses static precomputed routing tables for selecting routing paths within a network. Existing oblivious routing schemes with polylogarithmic competitive ratio for general networks are tree-based, in the sense that routing is performed according to a convex combination of trees. However, this restriction to trees leads to a construction that has time quadratic in the size of the network and does not parallelize well. In this paper we study oblivious routing schemes based on electrical routing. In particular, we show that general networks with n vertices and m edges admit a routing scheme that has competitive ratio O(log² n) and consists of a convex combination of only O(√m) electrical routings. This immediately leads to an improved construction algorithm with time Õ(m^{3/2}) that can also be implemented in parallel with Õ(√m) depth. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Gramoz Goranci and Monika Henzinger and Harald Räcke and Sushant Sachdeva and A. R. Sricharan 2024 Is Part Of LIPIcs, Volume 287, 15th Innovations in Theoretical Computer Science Conference (ITCS 2024) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.ITCS.2024.55 urn:nbn:de:0030-drops-195830 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.55 eng https://creativecommons.org/licenses/by/4.0/legalcode