New lower bounds for oblivious routing in undirected graphs

DOI10.1145/1109557.1109658zbMath1192.90227MaRDI QIDQ3581557

Harald Räcke, Leighton Tom, Mohammad Taghi Hajiaghayi, Robert D. Kleinberg

Publication date: 16 August 2010

Published in: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1109557.1109658

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90C60: Abstract computational complexity for mathematical programming problems

68M10: Network design and communication in computer systems

68R10: Graph theory (including graph drawing) in computer science

05C85: Graph algorithms (graph-theoretic aspects)

Related Items

Electric routing and concurrent flow cutting