A Sublinear Algorithm for Approximate Shortest Paths in Large Networks.

@inproceedings{basu-2025-sublinear, author = {Sabyasachi Basu and Nadia Koshima and Talya Eden and Omri Ben-Eliezer and C. Seshadhri}, editor = {Wolfgang Nejdl and S\"{o}ren Auer and Meeyoung Cha and Marie-Francine Moens and Marc Najork}, title = {{A Sublinear Algorithm for Approximate Shortest Paths in Large Networks}}, booktitle = {{Proceedings of the Eighteenth ACM International Conference on Web Search and Data Mining, WSDM 2025, Hannover, Germany, March 10-14, 2025}}, pages = {20--29}, publisher = {ACM}, year = {2025}, url = {https://doi.org/10.1145/3701551.3703512}, doi = {https://doi.org/10.1145/3701551.3703512} }