D. Finocchiaro, M. Pellegrini, "On computing the diameter of a point set in high dimensional Euclidean space", ESA'99. Home/Search Document Details and Download
Summary Related Articles |
This paper is cited in the following contexts:
Reductions Among High Dimensional Proximity Problems - Goel, Indyk, Varadarajan (2000) (5 citations) (Correct)
....Matching, and Approximate Minimum Weight Matching. University of Southern California. Email: agoel cs.usc.edu . y Stanford University. Email: indyk cs.stanford.edu . z University of Iowa. Email: kvaradar cs.uiowa.edu . 0 Problem Ref Approx. Time Comments Diameter [10] p 3 O(dn) [12] 1 ffl O(dn log n n 2 ) 2] 1 ffl O(n 2 GammaO(ffl 2 ) dn) 18] 1 ffl O(n 1 1= 1 ffl=6) dn) here 1 ffl O(n 1 1= 1 ffl) dn) O(n) 1 ffl) NNS queries here p 2 O(dn) see Section 3 for some evidence of optimality of p 2 among O(dn) time algorithms ....
D. Finocchiaro, M. Pellegrini, "On computing the diameter of a point set in high dimensional Euclidean space", ESA'99.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC