Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Flics, Jeremy"'
Autor:
Bodwin, Greg, Flics, Jeremy
A recent upper bound by Le and Solomon [STOC '23] has established that every $n$-node graph has a $(1+\varepsilon)(2k-1)$-spanner with lightness $O(\varepsilon^{-1} n^{1/k})$. This bound is optimal up to its dependence on $\varepsilon$; the remaining
Externí odkaz:
http://arxiv.org/abs/2406.04459
