Publisher
Springer Berlin Heidelberg
Reference29 articles.
1. Alon, N., Awerbuch, B., Azar, Y., Buchbinder, N., Naor, J.S.: A general approach to online network optimization problems. In: Proc. of the 15th SODA, pp. 577–586 (2004)
2. Azar, Y., Cohen, E., Fiat, A., Kaplan, H., Räcke, H.: Optimal oblivious routing in polynomial time. In: Proc. of the 35th STOC, pp. 383–388 (2003)
3. Bartal, Y.: Probabilistic approximations of metric spaces and its algorithmic applications. In: Proc. of the 37th FOCS, pp. 184–193 (1996)
4. Bartal, Y.: On approximating arbitrary metrics by tree metrics. In: Proc. of the 30th STOC, pp. 161–168 (1998)
5. Lecture Notes in Computer Science;Y. Bartal,1997
Cited by
27 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. LASER: Learning Enhanced Segment Routing Using Link Telemetry;2024 IEEE 25th International Conference on High Performance Switching and Routing (HPSR);2024-07-22
2. Hop-Constrained Oblivious Routing Using Prim’s-Sollin’s Algorithm;Lecture Notes on Data Engineering and Communications Technologies;2024
3. Sparse Semi-Oblivious Routing: Few Random Paths Suffice;Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing;2023-06-16
4. Demand-oblivious routing in complex networks under uncertainty;AEU - International Journal of Electronics and Communications;2023-05
5. Robust Routing Made Easy: Reinforcing Networks Against Non-Benign Faults;IEEE/ACM Transactions on Networking;2023