English
Related papers

Related papers: Near Isometric Terminal Embeddings for Doubling Me…

200 papers

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 as {\em terminals}. The objective is to embed the metric into…

Data Structures and Algorithms · Computer Science 2016-03-09 Michael Elkin , Arnold Filtser , Ofer Neiman

Recently (Elkin, Filtser, Neiman 2017) introduced the concept of a {\it terminal embedding} from one metric space $(X,d_X)$ to another $(Y,d_Y)$ with a set of designated terminals $T\subset X$. Such an embedding $f$ is said to have…

Data Structures and Algorithms · Computer Science 2024-08-07 Yeshwanth Cherapanamjeri , Jelani Nelson

In this paper we devise an optimal construction of fault-tolerant spanners for doubling metrics. Specifically, for any $n$-point doubling metric, any $\eps > 0$, and any integer $0 \le k \le n-2$, our construction provides a…

Data Structures and Algorithms · Computer Science 2013-05-09 Shay Solomon

We initiate the study of metric embeddings with \emph{outliers}. Given some metric space $(X,\rho)$ we wish to find a small set of outlier points $K \subset X$ and either an isometric or a low-distortion embedding of $(X\setminus K,\rho)$…

Data Structures and Algorithms · Computer Science 2015-08-17 Anastasios Sidiropoulos , Yusu Wang

In this paper we prove the existence of H\"{o}lder continuous terminal embeddings of any desired $X \subseteq \mathbb{R}^d$ into $\mathbb{R}^{m}$ with $m=\mathcal{O}(\varepsilon^{-2}\omega(S_X)^2)$, for arbitrarily small distortion…

Optimization and Control · Mathematics 2024-08-07 Simone Brugiapaglia , Rafael Chiclana , Tim Hoheisel , Mark Iwen

It is known that any $n$-point set in the $d$-dimensional Euclidean space $\mathbb{R}^d$, for $d = O(1)$, admits: 1) a $(1+\epsilon)$-spanner with maximum degree $\tilde{O}(\epsilon^{-d+1})$ and with lightness $\tilde{O}(\epsilon^{-d})$; 2)…

Computational Geometry · Computer Science 2026-03-30 An La , Hung Le , Shay Solomon , Cuong Than , Vinayak , Shuang Yang , Tianyi Zhang

Metric embeddings traditionally study how to map $n$ items to a target metric space such that distance lengths are not heavily distorted; but what if we only care to preserve the relative order of the distances (and not their length)? In…

Data Structures and Algorithms · Computer Science 2024-01-01 Vaggos Chatziafratis , Piotr Indyk

Metric spaces $(X, d)$ are ubiquitous objects in mathematics and computer science that allow for capturing (pairwise) distance relationships $d(x, y)$ between points $x, y \in X$. Because of this, it is natural to ask what useful…

Computational Geometry · Computer Science 2023-08-10 Willow Barkan-Vered , Huck Bennett , Amir Nayyeri

We consider the problem of matching a metric space $(X,d_X)$ of size $k$ with a subspace of a metric space $(Y,d_Y)$ of size $n \geq k$, assuming that these two spaces have constant doubling dimension $\delta$. More precisely, given an…

Data Structures and Algorithms · Computer Science 2020-12-22 Corentin Allair , Antoine Vigneron

Given a finite metric space $(X\cup Y, \mathbf{d})$ the $k$-median problem is to find a set of $k$ centers $C\subseteq Y$ that minimizes $\sum_{p\in X} \min_{c\in C} \mathbf{d}(p,c)$. In general metrics, the best polynomial time algorithm…

Data Structures and Algorithms · Computer Science 2026-03-26 Anne Driemel , Jan Höckendorff , Ioannis Psarros , Christian Sohler , Di Yue

A set of points $P$ in a metric space and a constant integer $k$ are given. The $k$-center problem finds $k$ points as centers among $P$, such that the maximum distance of any point of $P$ to their closest centers $(r)$ is minimized.…

Data Structures and Algorithms · Computer Science 2019-04-25 Sepideh Aghamolaei , Mohammad Ghodsi

It has long been known that $d$-dimensional Euclidean point sets admit $(1+\epsilon)$-stretch spanners with lightness $W_E = \epsilon^{-O(d)}$, that is total edge weight at most $W_E$ times the weight of the minimum spaning tree of the set…

Computational Geometry · Computer Science 2015-05-15 Lee-Ad Gottlieb

Metric data structures (distance oracles, distance labeling schemes, routing schemes) and low-distortion embeddings provide a powerful algorithmic methodology, which has been successfully applied for approximation algorithms \cite{llr},…

Data Structures and Algorithms · Computer Science 2015-04-08 Michael Elkin , Arnold Filtser , Ofer Neiman

Conformal mapping is an important mathematical tool in many physical and engineering fields, especially in electrostatics, fluid mechanics, classical mechanics, and transformation optics. However in the existing textbooks and literatures,…

Classical Physics · Physics 2015-11-10 Weimin Wang , Wenying Ma , Qiang Wang , Hao Ren

An essential requirement of spanners in many applications is to be fault-tolerant: a $(1+\epsilon)$-spanner of a metric space is called (vertex) $f$-fault-tolerant ($f$-FT) if it remains a $(1+\epsilon)$-spanner (for the non-faulty points)…

Computational Geometry · Computer Science 2024-02-09 Hung Le , Shay Solomon , Cuong Than

Spanners for low dimensional spaces (e.g. Euclidean space of constant dimension, or doubling metrics) are well understood. This lies in contrast to the situation in high dimensional spaces, where except for the work of Har-Peled, Indyk and…

Data Structures and Algorithms · Computer Science 2018-04-23 Arnold Filtser , Ofer Neiman

For any finite point set in $D$-dimensional space equipped with the 1-norm, we present random linear embeddings to $k$-dimensional space, with a new metric, having the following properties. For any pair of points from the point set that are…

Probability · Mathematics 2020-11-09 Michael P. Casey

We show if a metric measure space admits a differentiable structure then porous sets have measure zero and hence the measure is pointwise doubling. We then give a construction to show if we only require an approximate differentiable…

Metric Geometry · Mathematics 2014-02-11 David Bate , Gareth Speight

We construct quasiconformal mappings in Euclidean spaces by integration of a discontinuous kernel against doubling measures with suitable decay. The differentials of mappings that arise in this way satisfy an isotropic form of the doubling…

Classical Analysis and ODEs · Mathematics 2007-09-03 Leonid V. Kovalev , Diego Maldonado , Jang-Mei Wu

Recently Elkin and Solomon gave a construction of spanners for doubling metrics that has constant maximum degree, hop-diameter O(log n) and lightness O(log n) (i.e., weight O(log n)w(MST). This resolves a long standing conjecture proposed…

Data Structures and Algorithms · Computer Science 2012-07-05 T-H. Hubert Chan , Mingfei Li , Li Ning
‹ Prev 1 2 3 10 Next ›