Scattering and sparse partitions, and their applications
A Filtser - ACM Transactions on Algorithms, 2024 - dl.acm.org
A partition of a weighted graph is-sparse if every cluster has diameter at most, and every ball
of radius intersects at most clusters. Similarly, is-scattering if instead for balls, we require that …
of radius intersects at most clusters. Similarly, is-scattering if instead for balls, we require that …
The greedy spanner is existentially optimal
The greedy spanner is arguably the simplest and most well-studied spanner construction.
Experimental results demonstrate that it is at least as good as any other spanner …
Experimental results demonstrate that it is at least as good as any other spanner …
Labeled nearest neighbor search and metric spanners via locality sensitive orderings
A Filtser - arxiv preprint arxiv:2211.11846, 2022 - arxiv.org
Chan, Har-Peled, and Jones [SICOMP 2020] developed locality-sensitive orderings (LSO)
for Euclidean space. A $(\tau,\rho) $-LSO is a collection $\Sigma $ of orderings such that for …
for Euclidean space. A $(\tau,\rho) $-LSO is a collection $\Sigma $ of orderings such that for …
Constructing light spanners deterministically in near-linear time
Graph spanners are well-studied and widely used both in theory and practice. In a recent
breakthrough, Chechik and Wulff-Nilsen [10] improved the state-of-the-art for light spanners …
breakthrough, Chechik and Wulff-Nilsen [10] improved the state-of-the-art for light spanners …
Locality-sensitive orderings and applications to reliable spanners
Chan, Har-Peled, and Jones [2020] recently developed locality-sensitive ordering (LSO), a
new tool that allows one to reduce problems in the Euclidean space ℝ d to the 1 …
new tool that allows one to reduce problems in the Euclidean space ℝ d to the 1 …
Online Duet between Metric Embeddings and Minimum-Weight Perfect Matchings
Low-distortional metric embeddings are a crucial component in the modern algorithmic
toolkit. In an online metric embedding, points arrive sequentially and the goal is to embed …
toolkit. In an online metric embedding, points arrive sequentially and the goal is to embed …
Fast tree-field integrators: From low displacement rank to topological transformers
We present a new class of fast polylog-linear algorithms based on the theory of structured
matrices (in particular low displacement rank) for integrating tensor fields defined on …
matrices (in particular low displacement rank) for integrating tensor fields defined on …
The greedy spanner is existentially optimal
The greedy spanner is arguably the simplest and most well-studied spanner construction.
Experimental results demonstrate that it is at least as good as any other spanner …
Experimental results demonstrate that it is at least as good as any other spanner …
A face cover perspective to ℓ1 embeddings of planar graphs
A Filtser - Proceedings of the Fourteenth Annual ACM-SIAM …, 2020 - SIAM
It was conjectured by Gupta et al.[Combinatorica04] that every planar graph can be
embedded into ℓ 1 with constant distortion. However, given an n-vertex weighted planar …
embedded into ℓ 1 with constant distortion. However, given an n-vertex weighted planar …
Steiner Point Removal with Distortion O(log k)
A Filtser - Proceedings of the Twenty-Ninth Annual ACM-SIAM …, 2018 - SIAM
In the Steiner point removal (SPR) problem, we are given a weighted graph G=(V, E) and a
set of terminals K⊂ V of size k. The objective is to find a minor M of G with only the terminals …
set of terminals K⊂ V of size k. The objective is to find a minor M of G with only the terminals …