Improved all-pairs approximate shortest paths in congested clique
Crossref DOI link: https://doi.org/10.1007/s00446-025-00501-y
Published Online: 2026-04-04
Published Print: 2026-06
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Bui, Hong Duc
Chandra, Shashwat
Chang, Yi-Jun
Dory, Michal
Leitersdorf, Dean
Text and Data Mining valid from 2026-04-04
Version of Record valid from 2026-04-04
Article History
Received: 29 July 2024
Accepted: 19 December 2025
First Online: 4 April 2026
Declarations
:
: The authors declare no competing interests.