Electric routing and concurrent flow cutting

DOI10.1016/j.tcs.2010.06.013zbMath1221.68172OpenAlexW2570775423MaRDI QIDQ553348

Petar Maymounkov, Jonathan A. Kelner

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

zbMATH Keywords

Laplacian operatoroblivious routingspectral graph theory

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Internet topics (68M11)

Related Items

Randomized oblivious integral routing for minimizing power cost ⋮ Graph Sparsification, Spectral Sketches, and Faster Resistance Computation via Short Cycle Decompositions

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
• [https://portal.mardi4nfdi.de/wiki/Publication:4337503 Open problems of Paul Erd�s in graph theory]
• Compact name-independent routing with minimum stretch
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item