On Approximating the Average Distance Between Points

@inproceedings{Barhum2007OnAT,
  title={On Approximating the Average Distance Between Points},
  author={Kfir Barhum and Oded Goldreich and Adi Shraibman},
  booktitle={APPROX-RANDOM},
  year={2007}
}
We consider the problem of approximating the average distance between pairs of points in a high-dimensional Euclidean space, and more generally in any metric space. We consider two algorithmic approaches: 1. Referring only to Euclidean Spaces, we randomly reduce the highdimensional problem to a one-dimensional problem, which can be solved in time that is almost-linear in the number of points. The resulting algorithm is somewhat better than a related algorithm that can be obtained by using the… CONTINUE READING

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-7 of 7 references

Sublinear Time Algorithms for Metric Space Problems

STOC • 1999
View 5 Excerpts
Highly Influenced

Approximating average parameters of graphs

Random Struct. Algorithms • 2005
View 3 Excerpts

On Lipschitz Embedding of Finite Metric Spaces in Hilbert Space

J. Bourgain
Israel J. Math., Vol. 52, pages 46{52 • 1985

Extensions of Lipschitz Mappings into a Hilbert Space

W. B. Johnson, J. Lindenstrauss
Conf. in Modern Analysis and Probability, pages 189{206 • 1984
View 1 Excerpt

Similar Papers

Loading similar papers…