Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai. Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrier and Derandomization. SIAM Journal on Computing, 45(3):947-1006, 2016. [doi]
@article{HenzingerKN16-0,
title = {Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrier and Derandomization},
author = {Monika Henzinger and Sebastian Krinninger and Danupon Nanongkai},
year = {2016},
doi = {10.1137/140957299},
url = {http://dx.doi.org/10.1137/140957299},
researchr = {https://researchr.org/publication/HenzingerKN16-0},
cites = {0},
citedby = {0},
journal = {SIAM Journal on Computing},
volume = {45},
number = {3},
pages = {947-1006},
}