Steiner Point Removal with distortion O( k), using the Noisy-Voronoi algorithm

08/08/2018
by   Arnold Filtser, et al.
0

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 as its vertex set, such that distances between the terminals will be preserved up to a small multiplicative distortion. Kamma, Krauthgamer and Nguyen [SICOMP2015] devised a ball-growing algorithm with exponential distributions to show that the distortion is at most O(^5 k). Cheung [SODA2018] improved the analysis of the same algorithm, bounding the distortion by O(^2 k). We devise a novel and simpler algorithm (called the Noisy Voronoi algorithm) which incurs distortion O( k). This algorithm can be implemented in almost linear time (O(|E| |V|)).

READ FULL TEXT
research
04/01/2021

O(1) Steiner Point Removal in Series-Parallel Graphs

We study how to vertex-sparsify a graph while preserving both the graph'...
research
01/04/2021

Clan Embeddings into Trees, and Low Treewidth Graphs

In low distortion metric embeddings, the goal is to embed a host "hard" ...
research
12/20/2020

Pattern Matching in Doubling Spaces

We consider the problem of matching a metric space (X,d_X) of size k wit...
research
02/28/2022

Rate-Distortion Problems of the Poisson Process based on a Group-Theoretic Approach

We study rate-distortion problems of a Poisson process using a group the...
research
06/20/2023

Composition of nested embeddings with an application to outlier removal

We study the design of embeddings into Euclidean space with outliers. Gi...
research
04/20/2022

Functional Covering of Point Processes

We introduce a new distortion measure for point processes called functio...

Please sign up or login with your details

Forgot password? Click here to reset