On Approximating the Average Distance Between Points

DOI10.1007/978-3-540-74208-1_22zbMATH Open1171.68862OpenAlexW1523953616MaRDI QIDQ3603473FDOQ3603473

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

Recommendations

• On Las Vegas approximations for metric 1-median selection
• Reporting neighbors in high-dimensional Euclidean space
• On computing the diameter of a point set in high dimensional Euclidean space.
• Reporting neighbors in high-dimensional Euclidean space
• Automata, Languages and Programming

Mathematics Subject Classification ID

Randomized algorithms (68W20)

Cited In (12)

• The average distance between two points in isosceles trapezoid
• Minimum Average Distance Triangulations
• Using minimum degree to bound average distance
• Computing the Expected Value and Variance of Geometric Measures
• Title not available (Why is that?)
• On random perfect matchings in metric spaces with not-too-large diameters
• Maintaining approximate extent measures of moving points
• Title not available (Why is that?)
• THE AVERAGE DISTANCE BETWEEN TWO POINTS
• Algorithms for graphs of bounded treewidth via orthogonal range searching
• Expanders with respect to Hadamard spaces and random graphs
• On Las Vegas approximations for metric 1-median selection

This page was built for publication: On Approximating the Average Distance Between Points

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3603473)