7 citations · 16 across the 30 of their papers we have counts for
5 papers · 1 filter
Labelings vs. Embeddings: On Distributed Representations of Distances
Arnold Filtser, Lee-Ad Gottlieb, Robert Krauthgamer
We investigate for which metric spaces the performance of distance labeling and of -embeddings differ, and how significant can this difference be. Recall that a distan…
On Strong Diameter Padded Decompositions
Arnold Filtser
Given a weighted graph , a partition of is -bounded if the diameter of each cluster is bounded by . A distribution over -bounded partitions is a -padded…
Distributed Construction of Light Networks
Michael Elkin, Arnold Filtser, Ofer Neiman
A -{\em spanner} of a weighted graph is a subgraph that approximates all pairwise distances up to a factor of . The {\em lightness} of is defined as the r…
A face cover perspective to embeddings of planar graphs
Arnold Filtser
It was conjectured by Gupta et al. [Combinatorica04] that every planar graph can be embedded into with constant distortion. However, given an -vertex weighted planar gr…
Approximate Nearest Neighbor for Curves: Simple, Efficient, and Deterministic
Arnold Filtser, Omrit Filtser, Matthew J. Katz
In the -approximate near-neighbor problem for curves (ANNC) under some distance measure , the goal is to construct a data structure for a given set $\mathcal{…