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

Aaron Bernstein

Browse the full FOCS paper archive.