Optimal oblivious routing in polynomial time
From MaRDI portal
Publication:5901088
DOI10.1145/780542.780599zbMath1192.90253OpenAlexW1971443646MaRDI QIDQ5901088
Amos Fiat, Edith Cohen, Yossi Azar, Harald Räcke, Haim Kaplan
Publication date: 16 August 2010
Published in: Proceedings of the thirty-fifth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/780542.780599
Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Network design and communication in computer systems (68M10)
Related Items (7)
Atomic routing games on maximum congestion ⋮ OSPF routing with optimal oblivious performance ratio under polyhedral demand uncertainty ⋮ From Duels to Battlefields: Computing Equilibria of Blotto and Other Games ⋮ Unnamed Item ⋮ Oblivious Routing for Sensor Network Topologies ⋮ Survey on Oblivious Routing Strategies ⋮ Optimal oblivious routing under linear and ellipsoidal uncertainty
This page was built for publication: Optimal oblivious routing in polynomial time
