Oblivious routing in directed graphs with random demands

DOI10.1145/1060590.1060619zbMath1192.90229OpenAlexW2106481801MaRDI QIDQ3581422

Harald Räcke, Jeong Han Kim, Leighton Tom, Mohammad Taghi Hajiaghayi

Publication date: 16 August 2010

Published in: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Directed graphs (digraphs), tournaments (05C20) Network protocols (68M12)

Related Items (2)

Submodular Functions: Learnability, Structure, and Optimization ⋮ Configuration balancing for stochastic requests

This page was built for publication: Oblivious routing in directed graphs with random demands