English

Dynamic Decremental Approximate Distance Oracles with $(1+\epsilon, 2)$ stretch

Data Structures and Algorithms 2013-07-08 v1

Abstract

We provide a decremental approximate Distance Oracle that obtains stretch of 1+ϵ1+\epsilon multiplicative and 2 additive and has O^(n5/2)\hat{O}(n^{5/2}) total cost (where O^\hat{O} notation suppresses polylogarithmic and nO(1)/nn^{O(1)/\sqrt{n}} factors). The best previous results with O^(n5/2)\hat{O}(n^{5/2}) total cost obtained stretch 3+ϵ3+\epsilon.

Cite

@article{arxiv.1307.1516,
  title  = {Dynamic Decremental Approximate Distance Oracles with $(1+\epsilon, 2)$ stretch},
  author = {Ittai Abraham and Shiri Chechik},
  journal= {arXiv preprint arXiv:1307.1516},
  year   = {2013}
}
R2 v1 2026-06-22T00:45:59.208Z