Triangulation and embedding using small sets of beacons
From MaRDI portal
Publication:3452228
DOI10.1145/1568318.1568322zbMath1325.68030OpenAlexW2621446776MaRDI QIDQ3452228
Tom Wexler, Aleksandrs Slivkins, Jon M. Kleinberg
Publication date: 11 November 2015
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1568318.1568322
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Distributed algorithms (68W15) Internet topics (68M11)
Related Items
Streaming Embeddings with Slack, Metric embedding, hyperbolic space, and social networks, Unnamed Item, Terminal embeddings, Lossless Prioritized Embeddings, Prioritized Metric Structures and Embedding, Diversity-normed spaces and diversity embeddings, Sums of distances on graphs and embeddings into Euclidean space, On the establishment of distinct identities in overlay networks, Distance estimation and object location via rings of neighbors, Using the doubling dimension to analyze the generalization of learning algorithms, Volume in general metric spaces, Network alignment by discrete Ollivier-Ricci flow, Advances in metric embedding theory, The idemetric property: when most distances are (almost) the same, Shortest-path queries in static networks, Virtual raw anchor coordinates: a new localization paradigm, Efficient distributed computation of distance sketches in networks, On notions of distortion and an almost minimum spanning tree with constant average distortion, On the Impossibility of Dimension Reduction for Doubling Subsets of $\ell_{p}$, Embedding Metrics into Ultrametrics and Graphs into Spanning Trees with Constant Average Distortion, Low-Distortion Inference of Latent Similarities from a Multiplex Social Network, Metric Spaces with Expensive Distances
