@InProceedings{chechik_et_al:LIPIcs.APPROX-RANDOM.2015.659,
author = {Chechik, Shiri and Cohen, Edith and Kaplan, Haim},
title = {{Average Distance Queries through Weighted Samples in Graphs and Metric Spaces: High Scalability with Tight Statistical Guarantees}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2015)},
pages = {659--679},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-89-7},
ISSN = {1868-8969},
year = {2015},
volume = {40},
editor = {Garg, Naveen and Jansen, Klaus and Rao, Anup and Rolim, Jos\'{e} D. P.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2015.659},
URN = {urn:nbn:de:0030-drops-53291},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2015.659},
annote = {Keywords: Closeness Centrality; Average Distance; Metric Space; Weighted Sampling}
}