Polynomial approximate discretization of geometric centers in high-dimensional Euclidean space (Q6161667): Difference between revisions

@@ Property / DOI @@
-.1007/s11634-021-00481-4
@@ Property / DOI: 10.1007/s11634-021-00481-4 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s11634-021-00481-4
+Normal rank
@@ Property / OpenAlex ID @@
+W4200036743
@@ Property / OpenAlex ID: W4200036743 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5290249
@@ Property / cites work: Q5290249 / rank @@
+Normal rank
@@ Property / cites work @@
+Better Guarantees for $k$-Means and Euclidean $k$-Median by Primal-Dual Algorithms
+Normal rank
@@ Property / cites work @@
+Q4091421
@@ Property / cites work: Q4091421 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3050437
@@ Property / cites work: Q3050437 / rank @@
+Normal rank
@@ Property / cites work @@
+NP-hardness of Euclidean sum-of-squares clustering
+Normal rank
@@ Property / cites work @@
+Approximate clustering via core-sets
@@ Property / cites work: Approximate clustering via core-sets / rank @@
+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 @@
+Computing Minimum-Weight Perfect Matchings
@@ Property / cites work: Computing Minimum-Weight Perfect Matchings / rank @@
+Normal rank
@@ Property / cites work @@
+A PTAS for k-means clustering based on weak coresets
+Normal rank
@@ Property / cites work @@
+Clustering to minimize the maximum intercluster distance
+Normal rank
@@ Property / cites work @@
+Q4471341
@@ Property / cites work: Q4471341 / rank @@
+Normal rank
@@ Property / cites work @@
+A simple \(D^2\)-sampling based PTAS for \(k\)-means and other clustering problems
+Normal rank
@@ Property / cites work @@
+Approximate minimum enclosing balls in high dimensions using core-sets
+Normal rank
@@ Property / cites work @@
+Linear-time approximation schemes for clustering problems in any dimensions
+Normal rank
@@ Property / cites work @@
+Improved and simplified inapproximability for \(k\)-means
+Normal rank
@@ Property / cites work @@
+Quadratic Time, Linear Space Algorithms for Gram-Schmidt Orthogonalization and Gaussian Sampling in Structured Lattices
+Normal rank
@@ Property / cites work @@
+On the complexity of some geometric problems in unbounded dimension
+Normal rank
@@ Property / cites work @@
+On the Complexity of Some Common Geometric Location Problems
+Normal rank
@@ Property / cites work @@
+An approximation scheme for a problem of search for a vector subset
+Normal rank
@@ Property / cites work @@
+Complexity and approximation of the smallest \(k\)-enclosing ball problem
+Normal rank
@@ Property / cites work @@
+Linear-size universal discretization of geometric center-based problems in fixed dimensions
+Normal rank
@@ Property / DOI @@
+.1007/S11634-021-00481-4
@@ Property / DOI: 10.1007/S11634-021-00481-4 / rank @@
+Normal rank