A lower bound for metric 1-median selection (Q340556): Difference between revisions

@@ Property / arXiv ID @@
+.2195
@@ Property / arXiv ID: 1401.2195 / rank @@
+Normal rank
@@ Property / cites work @@
+Local Search Heuristics for <i>k</i>-Median and Facility Location Problems
+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 @@
+A deterministic sublinear-time nonadaptive algorithm for metric 1-median selection
+Normal rank
@@ Property / cites work @@
+Metric 1-Median Selection: Query Complexity vs. Approximation Ratio
+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 @@
+Fast Approximation of Centrality
@@ Property / cites work: Fast Approximation of Centrality / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating average parameters of graphs
@@ Property / cites work: Approximating average parameters of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Sublinear time algorithms for metric space problems
+Normal rank
@@ Property / cites work @@
+A new greedy approach for facility location 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 @@
+Randomized query processing in robot path planning
+Normal rank
@@ Property / cites work @@
+Linear-time approximation schemes for clustering problems in any dimensions
+Normal rank
@@ Property / cites work @@
+A 1.488 approximation algorithm for the uncapacitated facility location problem
+Normal rank
@@ Property / cites work @@
+Approximating $k$-Median via Pseudo-Approximation
@@ Property / cites work: Approximating $k$-Median via Pseudo-Approximation / rank @@
+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 @@
+A Lower Bound for the Complexity of Monotone Graph Properties
+Normal rank
@@ Property / cites work @@
+On approximating metric 1-median in sublinear time
+Normal rank