Distance estimation and object location via rings of neighbors
From MaRDI portal
Publication:5177222
DOI10.1145/1073814.1073823zbMath1314.68032MaRDI QIDQ5177222
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
68M10: Network design and communication in computer systems
68R10: Graph theory (including graph drawing) in computer science
05C12: Distance in graphs
05C78: Graph labelling (graceful graphs, bandwidth, etc.)
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
68M14: Distributed systems
68W15: Distributed algorithms
Related Items
Depth of Field and Cautious-Greedy Routing in Social Networks, On the Impossibility of Dimension Reduction for Doubling Subsets of $\ell_{p}$, Efficient distributed computation of distance sketches in networks, Using the doubling dimension to analyze the generalization of learning algorithms, Recovering the long-range links in augmented graphs, Universal augmentation schemes for network navigability, Navigable small-world networks with few random bits, Distance estimation and object location via rings of neighbors, Greedy routing in small-world networks with power-law degrees, Dynamic Routing and Location Services in Metrics of Low Doubling Dimension
