On Approximating the Average Distance Between Points
From MaRDI portal
Publication:3603473
DOI10.1007/978-3-540-74208-1_22zbMath1171.68862OpenAlexW1523953616MaRDI QIDQ3603473
Kfir Barhum, Oded Goldreich, Adi Shraibman
Publication date: 17 February 2009
Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-74208-1_22
Related Items (6)
Algorithms for graphs of bounded treewidth via orthogonal range searching ⋮ Computing the Expected Value and Variance of Geometric Measures ⋮ On random perfect matchings in metric spaces with not-too-large diameters ⋮ On Las Vegas approximations for metric 1-median selection ⋮ Expanders with respect to Hadamard spaces and random graphs ⋮ Unnamed Item
This page was built for publication: On Approximating the Average Distance Between Points
