Tree Embedding in High Dimensions: Dynamic and Massively Parallel
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908758385360896 |
|---|---|
| author | Goranci, Gramoz Jiang, Shaofeng H. -C. Kiss, Peter Kong, Qihao Qian, Yi Szilagyi, Eva |
| author_facet | Goranci, Gramoz Jiang, Shaofeng H. -C. Kiss, Peter Kong, Qihao Qian, Yi Szilagyi, Eva |
| contents | Tree embedding has been a fundamental method in algorithm design with wide applications. We focus on the efficiency of building tree embedding in various computational settings under high-dimensional Euclidean $\mathbb{R}^d$. We devise a new tree embedding construction framework that operates on an arbitrary metric decomposition with bounded diameter, offering a tradeoff between distortion and the locality of its algorithmic steps. This framework works for general metric spaces and may be of independent interest beyond the Euclidean setting. Using this framework, we obtain a dynamic algorithm that maintains an $O_ε(\log n)$-distortion tree embedding with update time $\tilde O(n^ε+ d)$ subject to point insertions/deletions, and a massively parallel algorithm that achieves $O_ε(\log n)$-distortion in $O(1)$ rounds and total space $\tilde O(n^{1 + ε})$ (for constant $ε\in (0, 1)$). These new tree embedding results allow for a wide range of applications. Notably, under a similar performance guarantee as in our tree embedding algorithms, i.e., $\tilde O(n^ε+ d)$ update time and $O(1)$ rounds, we obtain $O_ε(\log n)$-approximate dynamic and MPC algorithms for $k$-median and earth-mover distance in $\mathbb{R}^d$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_22490 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Tree Embedding in High Dimensions: Dynamic and Massively Parallel Goranci, Gramoz Jiang, Shaofeng H. -C. Kiss, Peter Kong, Qihao Qian, Yi Szilagyi, Eva Data Structures and Algorithms Tree embedding has been a fundamental method in algorithm design with wide applications. We focus on the efficiency of building tree embedding in various computational settings under high-dimensional Euclidean $\mathbb{R}^d$. We devise a new tree embedding construction framework that operates on an arbitrary metric decomposition with bounded diameter, offering a tradeoff between distortion and the locality of its algorithmic steps. This framework works for general metric spaces and may be of independent interest beyond the Euclidean setting. Using this framework, we obtain a dynamic algorithm that maintains an $O_ε(\log n)$-distortion tree embedding with update time $\tilde O(n^ε+ d)$ subject to point insertions/deletions, and a massively parallel algorithm that achieves $O_ε(\log n)$-distortion in $O(1)$ rounds and total space $\tilde O(n^{1 + ε})$ (for constant $ε\in (0, 1)$). These new tree embedding results allow for a wide range of applications. Notably, under a similar performance guarantee as in our tree embedding algorithms, i.e., $\tilde O(n^ε+ d)$ update time and $O(1)$ rounds, we obtain $O_ε(\log n)$-approximate dynamic and MPC algorithms for $k$-median and earth-mover distance in $\mathbb{R}^d$. |
| title | Tree Embedding in High Dimensions: Dynamic and Massively Parallel |
| topic | Data Structures and Algorithms |
| url | https://arxiv.org/abs/2510.22490 |