**Abstract**

We study dynamic -approximation algorithms for the all-pairs shortest paths problem in unweighted undirected -node -edge graphs under edge deletions. The fastest algorithm for this problem is a randomized algorithm with a total update time of and constant query time by Roditty and Zwick (FOCS 2004). The fastest deterministic algorithm is from a 1981 paper by Even and Shiloach (JACM 1981); it has a total update time of and constant query time. We improve these results as follows:

(1) We present an algorithm with a total update time of and constant query time that has an additive error of two in addition to the multiplicative error. This beats the previous time when . Note that the additive error is unavoidable since, even in the static case, an -time (a so-called truly subcubic) combinatorial algorithm with multiplicative error cannot have an additive error less than , unless we make a major breakthrough for Boolean matrix multiplication (Dor, Halperin and Zwick FOCS 1996) and many other long-standing problems (Vassilevska Williams and Williams FOCS 2010). The algorithm can also be turned into a -approximation algorithm (without an additive error) with the same time guarantees, improving the recent -approximation algorithm with running time of Bernstein and Roditty (SODA 2011) in terms of both approximation and time guarantees.

(2) We present a deterministic algorithm with a total update time of and a query time of . The algorithm has a multiplicative error of and gives the first improved deterministic algorithm since 1981. It also answers an open question raised by Bernstein in his STOC 2013 paper.

In order to achieve our results, we introduce two new techniques: (1) A *monotone Even-Shiloach tree* algorithm which maintains a bounded-distance shortest-paths tree on a certain type of emulator called *locally persevering emulator*. (2) A derandomization technique based on *moving Even-Shiloach trees* as a way to derandomize the standard random set argument. These techniques might be of independent interest.