A Sublinear Algorithm for Approximate Shortest Paths in Large Networks.

Sabyasachi Basu Nadia Koshima Talya Eden Omri Ben-Eliezer C. Seshadhri

Published in: CoRR (2024)

Keyphrases

shortest path
np hard
shortest path problem
path length
shortest path algorithm
dynamic programming
expectation maximization
social networks
optimal solution
finding the shortest path
objective function
simulated annealing
network analysis
optimal path
flow graph
minimum cost flow