Greedy Completion for Weighted $(α,β)$-Spanners
Fuente:
arXiv
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2026
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866915870955012096 |
|---|---|
| author | Tzalik, Elad |
| author_facet | Tzalik, Elad |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_17047 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Greedy Completion for Weighted $(α,β)$-Spanners Tzalik, Elad Data Structures and Algorithms 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. |
| title | Greedy Completion for Weighted $(α,β)$-Spanners |
| topic | Data Structures and Algorithms |
| url | https://arxiv.org/abs/2603.17047 |