Distance estimation and object location via rings of neighbors

DOI10.1145/1073814.1073823zbMath1314.68032OpenAlexW2154833764MaRDI QIDQ5177222

Aleksandrs Slivkins

Publication date: 10 March 2015

Published in: Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://hdl.handle.net/1813/5738

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (10)

Distance estimation and object location via rings of neighbors ⋮ Using the doubling dimension to analyze the generalization of learning algorithms ⋮ Dynamic Routing and Location Services in Metrics of Low Doubling Dimension ⋮ Depth of Field and Cautious-Greedy Routing in Social Networks ⋮ Recovering the long-range links in augmented graphs ⋮ Greedy routing in small-world networks with power-law degrees ⋮ Efficient distributed computation of distance sketches in networks ⋮ Universal augmentation schemes for network navigability ⋮ Navigable small-world networks with few random bits ⋮ On the Impossibility of Dimension Reduction for Doubling Subsets of $\ell_{p}$

This page was built for publication: Distance estimation and object location via rings of neighbors