(1 + ∊)-Approximate f-Sensitive Distance Oracles

DOI10.1137/1.9781611974782.96zbMath1410.68287OpenAlexW4234410874MaRDI QIDQ4575839

Shiri Chechik, Sarel Cohen, Haim Kaplan, Amos Fiat

Publication date: 16 July 2018

Published in: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611974782.96

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05) Approximation algorithms (68W25)

Related Items (5)

Efficient Oracles and Routing Schemes for Replacement Paths ⋮ Compact distance oracles with large sensitivity and low stretch ⋮ An efficient strongly connected components algorithm in the fault tolerant model ⋮ Incremental distance products via faulty shortest paths ⋮ Unnamed Item

This page was built for publication: (1 + ∊)-Approximate f-Sensitive Distance Oracles