@inproceedings{acf3ad5264bd461796750aafa55a1e2d,

title = "Near-optimal approximate decremental all pairs shortest paths",

abstract = " In this paper we consider the decremental approximate all-pairs shortest paths (APSP) problem, where given a graph G the goal is to maintain approximate shortest paths between all pairs of nodes in G under a sequence of online adversarial edge deletions. We present a decremental APSP algorithm for undirected weighted graphs with (2 + ϵ)k - 1 stretch, O(mn 1/k+o(1) log (nW)) total update time and O(loglog (nW)) query time for a fixed constant ϵ, where W is the maximum edge weight (assuming the minimum edge weight is 1) and k is any integer parameter. This is an exponential improvement both in the stretch and in the query time over previous works.",

keywords = "Dynamic algorithms, Emulator, Shortest paths",

author = "Shiri Chechik",

note = "Publisher Copyright: {\textcopyright} 2018 IEEE.; 59th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2018 ; Conference date: 07-10-2018 Through 09-10-2018",

year = "2018",

month = nov,

day = "30",

doi = "10.1109/FOCS.2018.00025",

language = "אנגלית",

series = "Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS",

publisher = "IEEE Computer Society",

pages = "170--181",

editor = "Mikkel Thorup",

booktitle = "Proceedings - 59th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2018",

address = "ארצות הברית",

}