On Sparse Covers of Minor Free Graphs, Low Dimensional Metric Embeddings, and other applications
Fuente:
arXiv
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866914996158464000 |
|---|---|
| author | Filtser, Arnold |
| author_facet | Filtser, Arnold |
| contents | Given a metric space $(X,d_X)$, a $(β,s,Δ)$-sparse cover is a collection of clusters $\mathcal{C}\subseteq P(X)$ with diameter at most $Δ$, such that for every point $x\in X$, the ball $B_X(x,\fracΔβ)$ is fully contained in some cluster $C\in \mathcal{C}$, and $x$ belongs to at most $s$ clusters in $\mathcal{C}$. Our main contribution is to show that the shortest path metric of every $K_r$-minor free graphs admits $(O(r),O(r^2),Δ)$-sparse cover, and for every $ε>0$, $(4+ε,O(\frac1ε)^r,Δ)$-sparse cover (for arbitrary $Δ>0$). We then use this sparse cover to show that every $K_r$-minor free graph embeds into $\ell_\infty^{\tilde{O}(\frac1ε)^{r+1}\cdot\log n}$ with distortion $3+ε$ (resp. into $\ell_\infty^{\tilde{O}(r^2)\cdot\log n}$ with distortion $O(r)$). Further, among other applications, this sparse cover immediately implies an algorithm for the oblivious buy-at-bulk problem in fixed minor free graphs with the tight approximation factor $O(\log n)$ (previously nothing beyond general graphs was known). |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2401_14060 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | On Sparse Covers of Minor Free Graphs, Low Dimensional Metric Embeddings, and other applications Filtser, Arnold Data Structures and Algorithms Computational Geometry Combinatorics Given a metric space $(X,d_X)$, a $(β,s,Δ)$-sparse cover is a collection of clusters $\mathcal{C}\subseteq P(X)$ with diameter at most $Δ$, such that for every point $x\in X$, the ball $B_X(x,\fracΔβ)$ is fully contained in some cluster $C\in \mathcal{C}$, and $x$ belongs to at most $s$ clusters in $\mathcal{C}$. Our main contribution is to show that the shortest path metric of every $K_r$-minor free graphs admits $(O(r),O(r^2),Δ)$-sparse cover, and for every $ε>0$, $(4+ε,O(\frac1ε)^r,Δ)$-sparse cover (for arbitrary $Δ>0$). We then use this sparse cover to show that every $K_r$-minor free graph embeds into $\ell_\infty^{\tilde{O}(\frac1ε)^{r+1}\cdot\log n}$ with distortion $3+ε$ (resp. into $\ell_\infty^{\tilde{O}(r^2)\cdot\log n}$ with distortion $O(r)$). Further, among other applications, this sparse cover immediately implies an algorithm for the oblivious buy-at-bulk problem in fixed minor free graphs with the tight approximation factor $O(\log n)$ (previously nothing beyond general graphs was known). |
| title | On Sparse Covers of Minor Free Graphs, Low Dimensional Metric Embeddings, and other applications |
| topic | Data Structures and Algorithms Computational Geometry Combinatorics |
| url | https://arxiv.org/abs/2401.14060 |