On computing the diameter of a point set in high dimensional Euclidean space. (Q1853493): Difference between revisions

@@ Property / cites work @@
+Q4004078
@@ Property / cites work: Q4004078 / rank @@
+Normal rank
@@ Property / cites work @@
+A survey of heuristics for the weighted matching problem
+Normal rank
@@ Property / cites work @@
+Q4250174
@@ Property / cites work: Q4250174 / rank @@
+Normal rank
@@ Property / cites work @@
+Learnability and the Vapnik-Chervonenkis dimension
+Normal rank
@@ Property / cites work @@
+Subquadratic approximation algorithms for clustering problems in high dimensional spaces
+Normal rank
@@ Property / cites work @@
+Diameter, width, closest line pair, and parametric searching
+Normal rank
@@ Property / cites work @@
+Applications of random sampling in computational geometry. II
+Normal rank
@@ Property / cites work @@
+Matrix multiplication via arithmetic progressions
@@ Property / cites work: Matrix multiplication via arithmetic progressions / rank @@
+Normal rank
@@ Property / cites work @@
+Central limit theorems for empirical measures
@@ Property / cites work: Central limit theorems for empirical measures / rank @@
+Normal rank
@@ Property / cites work @@
+Q3217346
@@ Property / cites work: Q3217346 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating the diameter of a set of points in the Euclidean space
+Normal rank
@@ Property / cites work @@
+On Sets of Distances of n Points
@@ Property / cites work: On Sets of Distances of n Points / rank @@
+Normal rank
@@ Property / cites work @@
+Q3270291
@@ Property / cites work: Q3270291 / rank @@
+Normal rank
@@ Property / cites work @@
+The Johnson-Lindenstrauss lemma and the sphericity of some graphs
+Normal rank
@@ Property / cites work @@
+Inner and outer \(j\)-radii of convex bodies in finite-dimensional normed spaces
+Normal rank
@@ Property / cites work @@
+Computational complexity of inner and outer \(j\)-radii of polytopes in finite-dimensional normed spaces
+Normal rank
@@ Property / cites work @@
+On the complexity of some basic problems in computational convexity. I. Containment problems
+Normal rank
@@ Property / cites work @@
+Printer graphics for clustering
@@ Property / cites work: Printer graphics for clustering / rank @@
+Normal rank
@@ Property / cites work @@
+\(\epsilon\)-nets and simplex range queries
@@ Property / cites work: \(\epsilon\)-nets and simplex range queries / rank @@
+Normal rank
@@ Property / cites work @@
+Extensions of Lipschitz mappings into a Hilbert space
+Normal rank
@@ Property / cites work @@
+Q4527027
@@ Property / cites work: Q4527027 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4057549
@@ Property / cites work: Q4057549 / rank @@
+Normal rank
@@ Property / cites work @@
+A deterministic algorithm for the three-dimensional diameter problem
+Normal rank
@@ Property / cites work @@
+Q4856179
@@ Property / cites work: Q4856179 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4401033
@@ Property / cites work: Q4401033 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3992847
@@ Property / cites work: Q3992847 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3241604
@@ Property / cites work: Q3241604 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3138881
@@ Property / cites work: Q3138881 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
+Normal rank
@@ Property / cites work @@
+Q4253255
@@ Property / cites work: Q4253255 / rank @@
+Normal rank
@@ Property / cites work @@
+On Constructing Minimum Spanning Trees in <i>k</i>-Dimensional Spaces and Related Problems
+Normal rank