Zobrazeno 1 - 10
of 76 930
pro vyhledávání: '"Spanner"'
Autor:
Chen, Yeyuan
The greedy algorithm adapted from Kruskal's algorithm is an efficient and folklore way to produce a $k$-spanner with girth at least $k+2$. The greedy algorithm has shown to be `existentially optimal', while it's not `universally optimal' for any cons
Externí odkaz:
http://arxiv.org/abs/2411.01486
We give a simple algorithm for maintaining a $n^{o(1)}$-approximate spanner $H$ of a graph $G$ with $n$ vertices as $G$ receives edge updates by reduction to the dynamic All-Pairs Shortest Paths (APSP) problem. Given an initially empty graph $G$, our
Externí odkaz:
http://arxiv.org/abs/2408.11368
We consider the problem of computing an approximate weighted shortest path in a weighted subdivision, with weights assigned from the set $\{0, 1, \infty\}$. We present a data structure $B$, which stores a set of convex, non-overlapping regions. These
Externí odkaz:
http://arxiv.org/abs/2407.01951
We construct $n$-node graphs on which any $O(n)$-size spanner has additive error at least $+\Omega(n^{3/17})$, improving on the previous best lower bound of $\Omega(n^{1/7})$ [Bodwin-Hoppenworth FOCS '22]. Our construction completes the first two ste
Externí odkaz:
http://arxiv.org/abs/2404.18337
Autor:
Carlton Kirby, Robbie Broughton
SHORTLISTED FOR THE TELEGRAPH SPORTS BOOK AWARDS 2020 – CYCLING BOOK OF THE YEAR'A genuine one-off with a ready wit and a killer anecdote to hand at all times'- Ian Cleverly, Rouleur'Carlton Kirby is no ordinary cycling commentator, so it is not su