Optimal oblivious routing in polynomial time
From MaRDI portal
Publication:5917575
DOI10.1016/j.jcss.2004.04.010zbMath1071.68001OpenAlexW4213272272MaRDI QIDQ5917575
Haim Kaplan, Harald Räcke, Yossi Azar, Edith Cohen, Amos Fiat
Publication date: 18 November 2004
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2004.04.010
Communication networks in operations research (90B18) Network design and communication in computer systems (68M10)
Related Items (7)
Serving in the Dark should be done Non-Uniformly ⋮ Affine routing for robust network design ⋮ An efficient approach to optimization of semi‐stable routing in multicommodity flow networks ⋮ On the approximability of robust network design ⋮ Unnamed Item ⋮ THRESHOLD RULES FOR ONLINE SAMPLE SELECTION ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Online algorithms. The state of the art
- Routing, merging, and sorting on parallel models of computation
- Randomized rounding: A technique for provably good algorithms and algorithmic proofs
- Geometric algorithms and combinatorial optimization
- Tight bounds for oblivious routing in the hypercube
- On-line routing of virtual circuits with applications to load balancing and machine scheduling
This page was built for publication: Optimal oblivious routing in polynomial time
