Arnold Filtser

activity

20162019

most citedSteiner Point Removal with Distortion

O (lo g k)

1 citations · 1 across the 1 of their papers we have counts for

collaborators

4 papers

cs.DS2019

Distributed Construction of Light Networks

Michael Elkin, Arnold Filtser, Ofer Neiman

A $t$ -{\em spanner} $H$ of a weighted graph $G = (V, E, w)$ is a subgraph that approximates all pairwise distances up to a factor of $t$ . The {\em lightness} of $H$ is defined as the r…

cs.DS2017

Ramsey Spanning Trees and their Applications

Ittai Abraham, Shiri Chechik, Michael Elkin +2

The metric Ramsey problem asks for the largest subset $S$ of a metric space that can be embedded into an ultrametric (more generally into a Hilbert space) with a given distortion.…

cs.DS2017★ 1 cited

Steiner Point Removal with Distortion $O (lo g k)$

Arnold Filtser

In the Steiner point removal (SPR) problem, we are given a weighted graph $G = (V, E)$ and a set of terminals $K \subset V$ of size $k$ . The objective is to find a minor $M$ of $G$ wit…

cs.DS2016

Terminal Embeddings

Michael Elkin, Arnold Filtser, Ofer Neiman

In this paper we study {\em terminal embeddings}, in which one is given a finite metric $(X, d_{X})$ (or a graph $G = (V, E)$ ) and a subset $K \subseteq X$ of its points are designated a…

Distributed Construction of Light Networks

Ramsey Spanning Trees and their Applications

Steiner Point Removal with Distortion O(logk)

Terminal Embeddings

Steiner Point Removal with Distortion $O (lo g k)$