Electric routing and concurrent flow cutting
From MaRDI portal
Publication:553348
DOI10.1016/j.tcs.2010.06.013zbMath1221.68172MaRDI QIDQ553348
Jonathan A. Kelner, Petar Maymounkov
Publication date: 27 July 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2010.06.013
Related Items
Cites Work
- Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
- Approximate distance oracles
- New lower bounds for oblivious routing in undirected graphs
- Compact name-independent routing with minimum stretch
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item