Approximate shortest paths and distance oracles in weighted unit-disk graphs
$\newcommand{\OO}[1]{O\left(#1\right)}\newcommand{\eps}{\varepsilon}$We present the first near-linear-time algorithm that computes a $(1+\eps)$-approximation of the diameter of a weighted unit-disk graph of $n$ vertices. Our algorithm requires $\OO{n \log^2 n}$ time for any constant $\eps>0$, so we...
Na minha lista:
| Principais autores: | , |
|---|---|
| Format: | Artigo |
| Sprog: | Inglês |
| Udgivet: |
Carleton University
2019-02-01
|
| Serier: | Journal of Computational Geometry |
| Online adgang: | https://jocg.org/index.php/jocg/article/view/3085 |
| Tags: |
Ingen Tags, Vær først til at tagge denne postø!
|