Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2401.01103 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909237351809024 |
|---|---|
| author | Harada, Kaito Kitamura, Naoki Izumi, Taisuke Masuzawa, Toshimitsu |
| author_facet | Harada, Kaito Kitamura, Naoki Izumi, Taisuke Masuzawa, Toshimitsu |
| contents | An \emph{$α$-approximate vertex fault-tolerant distance sensitivity oracle} (\emph{$α$-VSDO}) for a weighted input graph $G=(V, E, w)$ and a source vertex $s \in V$ is the data structure answering an $α$-approximate distance from $s$ to $t$ in $G-x$ for any given query $(x, t) \in V \times V$. It is a data structure version of the so-called single-source replacement path problem (SSRP). In this paper, we present a new \emph{nearly linear-time} algorithm of constructing a $(1 + ε)$-VSDO for any directed input graph with polynomially bounded integer edge weights. More precisely, the presented oracle attains $\tilde{O}(m \log (nW)/ ε+ n \log^2 (nW)/ε^2)$ construction time, $\tilde{O}(n \log (nW) / ε)$ size, and $\tilde{O}(1/ε)$ query time, where $n$ is the number of vertices, $m$ is the number of edges, and $W$ is the maximum edge weight. These bounds are all optimal up to polylogarithmic factors. To the best of our knowledge, this is the first non-trivial algorithm for SSRP/VSDO beating $\tilde{O}(mn)$ computation time for directed graphs with general edge weight functions, and also the first nearly linear-time construction breaking approximation factor 3. Such a construction has been unknown even for undirected and unweighted graphs. In addition, our result implies that the known conditional lower bounds for the exact SSRP computation does not apply to the case of approximation. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2401_01103 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | A Nearly Linear Time Construction of Approximate Single-Source Distance Sensitivity Oracles Harada, Kaito Kitamura, Naoki Izumi, Taisuke Masuzawa, Toshimitsu Data Structures and Algorithms An \emph{$α$-approximate vertex fault-tolerant distance sensitivity oracle} (\emph{$α$-VSDO}) for a weighted input graph $G=(V, E, w)$ and a source vertex $s \in V$ is the data structure answering an $α$-approximate distance from $s$ to $t$ in $G-x$ for any given query $(x, t) \in V \times V$. It is a data structure version of the so-called single-source replacement path problem (SSRP). In this paper, we present a new \emph{nearly linear-time} algorithm of constructing a $(1 + ε)$-VSDO for any directed input graph with polynomially bounded integer edge weights. More precisely, the presented oracle attains $\tilde{O}(m \log (nW)/ ε+ n \log^2 (nW)/ε^2)$ construction time, $\tilde{O}(n \log (nW) / ε)$ size, and $\tilde{O}(1/ε)$ query time, where $n$ is the number of vertices, $m$ is the number of edges, and $W$ is the maximum edge weight. These bounds are all optimal up to polylogarithmic factors. To the best of our knowledge, this is the first non-trivial algorithm for SSRP/VSDO beating $\tilde{O}(mn)$ computation time for directed graphs with general edge weight functions, and also the first nearly linear-time construction breaking approximation factor 3. Such a construction has been unknown even for undirected and unweighted graphs. In addition, our result implies that the known conditional lower bounds for the exact SSRP computation does not apply to the case of approximation. |
| title | A Nearly Linear Time Construction of Approximate Single-Source Distance Sensitivity Oracles |
| topic | Data Structures and Algorithms |
| url | https://arxiv.org/abs/2401.01103 |