New lower bounds for oblivious routing in undirected graphs

DOI10.1145/1109557.1109658zbMath1192.90227OpenAlexW4234158610MaRDI 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

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Electric routing and concurrent flow cutting

This page was built for publication: New lower bounds for oblivious routing in undirected graphs