All-pairs shortest paths with a sublinear additive error.

Liam Roditty Asaf Shapira

Published in: ACM Trans. Algorithms (2011)

Keyphrases

additive error
worst case
lower bound
asymptotically optimal
shortest path
response time
range queries
upper bound
np hard
arrival rate
similarity measure
objective function
optimal solution
nearest neighbor
massively parallel