Triangulation and embedding using small sets of beacons
DOI10.1145/1568318.1568322zbMATH Open1325.68030OpenAlexW2621446776MaRDI QIDQ3452228FDOQ3452228
Authors: Aleksandrs Slivkins, Tom Wexler, 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
Recommendations
- On the geometric factor of difference range positioning with a minimal number of beacons
- Beacon-based algorithms for geometric routing
- Designing reduced beacon trajectory for sensor localization
- Using mobile beacons to locate sensors in obstructed environments
- Hilbert mobile beacon for localisation and coverage in sensor networks
- Tight bounds for beacon-based coverage in simple rectilinear polygons
- Tight Bounds for Beacon-Based Coverage in Simple Rectilinear Polygons
- Combinatorics of beacon-based routing in three dimensions
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Distributed algorithms (68W15) Internet topics (68M11)
Cited In (25)
- Lossless Prioritized Embeddings
- Embedding Metrics into Ultrametrics and Graphs into Spanning Trees with Constant Average Distortion
- Diversity-normed spaces and diversity embeddings
- Low-Distortion Inference of Latent Similarities from a Multiplex Social Network
- Prioritized Metric Structures and Embedding
- Title not available (Why is that?)
- Virtual raw anchor coordinates: a new localization paradigm
- Using the doubling dimension to analyze the generalization of learning algorithms
- Combinatorics of beacon-based routing in three dimensions
- Sums of distances on graphs and embeddings into Euclidean space
- Advances in metric embedding theory
- Volume in general metric spaces
- On the Impossibility of Dimension Reduction for Doubling Subsets of $\ell_{p}$
- Tight Bounds for Beacon-Based Coverage in Simple Rectilinear Polygons
- Efficient distributed computation of distance sketches in networks
- Terminal embeddings
- Shortest-path queries in static networks
- On the establishment of distinct identities in overlay networks
- Metric embedding, hyperbolic space, and social networks
- The idemetric property: when most distances are (almost) the same
- Distance estimation and object location via rings of neighbors
- Streaming Embeddings with Slack
- Metric Spaces with Expensive Distances
- Network alignment by discrete Ollivier-Ricci flow
- On notions of distortion and an almost minimum spanning tree with constant average distortion
This page was built for publication: Triangulation and embedding using small sets of beacons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3452228)
