On computing the diameter of a point set in high dimensional Euclidean space-Reference-Cited by-同舟云学术

On computing the diameter of a point set in high dimensional Euclidean space

Published:2002-09 Issue:2 Volume:287 Page:501-514
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Finocchiaro Daniele V.,Pellegrini Marco

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference38 articles.

1. The Probabilistic Method;Alon,1992

2. A survey of heuristics for the weighted matching problem;Avis;Networks,1983

3. S.N. Bespamyatnikh, An efficient algorithm for the three-dimensional diameter problem, in: Proc. 9th Symp. on Discrete Algorithms, 1998, pp. 137–146.

4. Learnability and the Vapnik–Chervonenkis dimension;Blumer;J. ACM,1989

5. A. Borodin, R. Ostrovsky, Y. Rabani, Subquadratic approximation algorithms for clustering problems in high dimensional spaces, in: Proc. 31st ACM Symp. on the Theory of Computing, 1999, pp. 435–444.

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Preference elicitation as an optimization problem;Proceedings of the 12th ACM Conference on Recommender Systems;2018-09-27

2. Greedy Algorithms for Approximating the Diameter of Machine Learning Datasets in Multidimensional Euclidean Space: Experimental Results;ADCAIJ: Advances in Distributed Computing and Artificial Intelligence Journal;2018-09-13

3. Distributed PCP Theorems for Hardness of Approximation in P;2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS);2017-10

4. Quantum speed-up for unsupervised learning;Machine Learning;2012-08-31