 Previously, the best known decremental hopset algorithm had a hopbound of 2^{\tilde{O(\log^{3/4} n)}[HKN, FOCS'14].
<meaning-changed>  Previously, the best known decremental hopset algorithm had a hopbound of 2^{\tilde{O(\log^{3/4} n)}[HKN, FOCS'14].
 (\log^{3/4} n)}[HKN, FOCS'14].