Fully dynamic (2 + ε) approximate all-pairs shortest paths with fast query and close to linear update time | IEEE Conference Publication | IEEE Xplore