Greedy Completion for Weighted $(α,β)$-Spanners

We study $(α, β)$ -spanners for weighted graphs. We propose a simple greedy completion procedure which starts from a sparse initial graph, and repeatedly fixes pairs of vertices with a bad stretch, generalizing Kunedsen’s additive completion [SWAT '14]. As an application, we construct $(k, k - 1)$ -spanners for weighted graphs of size $\tilde{O} (n^{1 + 1 / k})$ , which were previously unknown.

Greedy Completion for Weighted $(α, β)$ -Spanners

文献摘要

讨论

讲解博客

AI智能校验

Greedy Completion for Weighted $(α, β)$ -Spanners

文献摘要

讨论

讲解博客

AI智能校验

Greedy Completion for Weighted (α,β)(α,β)-Spanners

文献摘要

讨论

|讲解博客

|AI智能校验

Greedy Completion for Weighted (α,β)(α,β)-Spanners

文献摘要

讨论

|讲解博客

|AI智能校验

Greedy Completion for Weighted $(α, β)$ -Spanners

讲解博客

AI智能校验

Greedy Completion for Weighted $(α, β)$ -Spanners

讲解博客

AI智能校验