Zuzic, Goran, Goranci, Gramoz, Ye, Mingquan, Haeupler, Bernhard, and Sun, Xiaorui. Universally-Optimal Distributed Shortest Paths and Transshipment via Graph-Based L1-Oblivious Routing. Retrieved from https://par.nsf.gov/biblio/10359537. Proceedings of the ACM-SIAM Symposium on Discrete Algorithms .
Zuzic, Goran, Goranci, Gramoz, Ye, Mingquan, Haeupler, Bernhard, & Sun, Xiaorui. Universally-Optimal Distributed Shortest Paths and Transshipment via Graph-Based L1-Oblivious Routing. Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, (). Retrieved from https://par.nsf.gov/biblio/10359537.
Zuzic, Goran, Goranci, Gramoz, Ye, Mingquan, Haeupler, Bernhard, and Sun, Xiaorui.
"Universally-Optimal Distributed Shortest Paths and Transshipment via Graph-Based L1-Oblivious Routing". Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (). Country unknown/Code not available. https://par.nsf.gov/biblio/10359537.
@article{osti_10359537,
place = {Country unknown/Code not available},
title = {Universally-Optimal Distributed Shortest Paths and Transshipment via Graph-Based L1-Oblivious Routing},
url = {https://par.nsf.gov/biblio/10359537},
abstractNote = {},
journal = {Proceedings of the ACM-SIAM Symposium on Discrete Algorithms},
author = {Zuzic, Goran and Goranci, Gramoz and Ye, Mingquan and Haeupler, Bernhard and Sun, Xiaorui},
}
Warning: Leaving National Science Foundation Website
You are now leaving the National Science Foundation website to go to a non-government website.
Website:
NSF takes no responsibility for and exercises no control over the views expressed or the accuracy of
the information contained on this site. Also be aware that NSF's privacy policy does not apply to this site.