Complexity and approximation of the smallest \(k\)-enclosing ball problem (Q2346580): Difference between revisions

@@ Property / cites work @@
+Approximation and inapproximability results for maximum clique of disc graphs in high dimensions
+Normal rank
@@ Property / cites work @@
+Q5290249
@@ Property / cites work: Q5290249 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding k points with minimum diameter and related problems
+Normal rank
@@ Property / cites work @@
+The complexity and approximability of finding maximum feasible subsystems of linear relations
+Normal rank
@@ Property / cites work @@
+Optimal core-sets for balls
@@ Property / cites work: Optimal core-sets for balls / rank @@
+Normal rank
@@ Property / cites work @@
+Static and Dynamic Algorithms for k-Point Clustering Problems
+Normal rank
@@ Property / cites work @@
+Iterated nearest neighbors and finding minimal polytopes
+Normal rank
@@ Property / cites work @@
+`` Strong '' NP-Completeness Results
@@ Property / cites work: `` Strong '' NP-Completeness Results / rank @@
+Normal rank
@@ Property / cites work @@
+Fast algorithms for computing the smallest \(k\)-enclosing circle
+Normal rank
@@ Property / cites work @@
+Approximate minimum enclosing balls in high dimensions using core-sets
+Normal rank
@@ Property / cites work @@
+Q3221403
@@ Property / cites work: Q3221403 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4154035
@@ Property / cites work: Q4154035 / rank @@
+Normal rank