Login / Signup

Fully Dynamic (2 + epsilon) Approximate All-Pairs Shortest Paths with Fast Query and Close to Linear Update Time.

Aaron Bernstein
Published in: FOCS (2009)
Keyphrases