Electrical flows for polylogarithmic competitive oblivious routing
From MaRDI portal
Cites work
- A new approach to computing maximum flows using electrical flows
- A tight bound on approximating arbitrary metrics by tree metrics
- An almost-linear time algorithm for uniform random spanning tree generation
- An almost-linear-time algorithm for approximate max flow in undirected graphs, and its multicommodity generalizations
- An efficient parallel solver for SDD linear systems
- Approximate undirected maximum flows in \(O(m\operatorname{polylog}(n))\) time
- Circulation control for faster minimum cost flow in unit-capacity graphs
- Computing cut-based hierarchical decompositions in almost linear time
- Computing maximum flow with augmenting electrical flows
- Electric routing and concurrent flow cutting
- Electrical flows, Laplacian systems, and faster approximation of maximum flow in undirected graphs
- Faster maxflow via improved dynamic spectral vertex sparsifiers
- Fully dynamic electrical flows: sparse maxflow faster than Goldberg-Rao
- Hop-constrained expander decompositions, oblivious routing, and distributed universal optimality
- Hop-constrained oblivious routing
- scientific article; zbMATH DE number 5485537 (Why is no real title available?)
- scientific article; zbMATH DE number 5764851 (Why is no real title available?)
- Localization of electrical flows
- Minor sparsifiers and the distributed Laplacian paradigm
- Mixing times and \(\ell_p\) bounds for oblivious routing
- Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
- Nested dissection meets IPMs: planar min-cost flow in nearly-linear time
- Oblivious Routing for the Lp-norm
- Sparse Semi-Oblivious Routing: Few Random Paths Suffice
- Sparsified Cholesky and multigrid solvers for connection Laplacians
- Spectral subspace sparsification
- Stable distributions, pseudorandom generators, embeddings, and data stream computation
- The multiplicative weights update method: a meta-algorithm and applications
This page was built for publication: Electrical flows for polylogarithmic competitive oblivious routing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6906374)
