Metric 1-Median Selection: Query Complexity vs. Approximation Ratio (Q2817856): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2777770977
@@ Property / OpenAlex ID: W2777770977 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.05662
@@ Property / arXiv ID: 1509.05662 / rank @@
+Normal rank
@@ Property / cites work @@
+Local Search Heuristics for <i>k</i>-Median and Facility Location Problems
+Normal rank
@@ Property / cites work @@
+A deterministic sublinear-time nonadaptive algorithm for metric 1-median selection
+Normal rank
@@ Property / cites work @@
+Some results on approximate 1-median selection in metric spaces
+Normal rank
@@ Property / cites work @@
+Deterministic sublinear-time approximations for metric 1-median selection
+Normal rank
@@ Property / cites work @@
+On Coresets for <i>k</i>-Median and <i>k</i>-Means Clustering in Metric and Euclidean Spaces and Their Applications
+Normal rank
@@ Property / cites work @@
+Sublinear time algorithms for metric space problems
+Normal rank
@@ Property / cites work @@
+A Simple D 2-Sampling Based PTAS for k-Means and other Clustering Problems
+Normal rank
@@ Property / cites work @@
+Linear-time approximation schemes for clustering problems in any dimensions
+Normal rank
@@ Property / cites work @@
+Optimal time bounds for approximate clustering
@@ Property / cites work: Optimal time bounds for approximate clustering / rank @@
+Normal rank
@@ Property / cites work @@
+On approximating metric 1-median in sublinear time
+Normal rank