Electric routing and concurrent flow cutting
From MaRDI portal
Publication:553348
Recommendations
- Electric routing and concurrent flow cutting
- Localization of electrical flows
- Mixing times and \(\ell_p\) bounds for oblivious routing
- Faster Approximation Algorithms For the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts
- A new approach to computing maximum flows using electrical flows
Cites work
- scientific article; zbMATH DE number 5485537 (Why is no real title available?)
- scientific article; zbMATH DE number 5764851 (Why is no real title available?)
- scientific article; zbMATH DE number 1931811 (Why is no real title available?)
- scientific article; zbMATH DE number 5485569 (Why is no real title available?)
- Approximate distance oracles
- Compact name-independent routing with minimum stretch
- Expanders via random spanning trees
- Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
- New lower bounds for oblivious routing in undirected graphs
- Open problems of Paul Erd�s in graph theory
Cited in
(5)- Mixing times and \(\ell_p\) bounds for oblivious routing
- Randomized oblivious integral routing for minimizing power cost
- Graph Sparsification, Spectral Sketches, and Faster Resistance Computation via Short Cycle Decompositions
- Localization of electrical flows
- Electric routing and concurrent flow cutting
This page was built for publication: Electric routing and concurrent flow cutting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q553348)
