Parameterized $k$-clustering: tractability island (Q2221803): Difference between revisions

@@ Property / DOI @@
-.1016/j.jcss.2020.10.005
@@ Property / DOI: 10.1016/j.jcss.2020.10.005 / rank @@
-Normal rank
@@ Property / author @@
-Petr A. Golovach
@@ Property / author: Petr A. Golovach / rank @@
-Normal rank
@@ Property / author @@
+Petr A. Golovach
@@ Property / author: Petr A. Golovach / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.jcss.2020.10.005
+Normal rank
@@ Property / OpenAlex ID @@
+W3100384259
@@ Property / OpenAlex ID: W3100384259 / rank @@
+Normal rank
@@ Property / cites work @@
+Least squares quantization in PCM
@@ Property / cites work: Least squares quantization in PCM / rank @@
+Normal rank
@@ Property / cites work @@
+Clustering for metric and nonmetric distance measures
+Normal rank
@@ Property / cites work @@
+Approximating extent measures of points
@@ Property / cites work: Approximating extent measures of points / rank @@
+Normal rank
@@ Property / cites work @@
+Approximate clustering via core-sets
@@ Property / cites work: Approximate clustering via core-sets / rank @@
+Normal rank
@@ Property / cites work @@
+Randomized Dimensionality Reduction for &lt;inline-formula&gt; &lt;tex-math notation="LaTeX"&gt;$k$ &lt;/tex-math&gt;&lt;/inline-formula&gt;-Means Clustering
+Normal rank
@@ Property / cites work @@
+Dimensionality Reduction for k-Means Clustering and Low Rank Approximation
+Normal rank
@@ Property / cites work @@
+A unified framework for approximating and clustering data
+Normal rank
@@ Property / cites work @@
+Turning Big data into tiny data: Constant-size coresets for <i>k</i>-means, PCA and projective clustering
+Normal rank
@@ Property / cites work @@
+On coresets for k-means and k-median clustering
@@ Property / cites work: On coresets for k-means and k-median clustering / rank @@
+Normal rank
@@ Property / cites work @@
+Linear-time approximation schemes for clustering problems in any dimensions
+Normal rank
@@ Property / cites work @@
+Approximation schemes for clustering problems
@@ Property / cites work: Approximation schemes for clustering problems / rank @@
+Normal rank
@@ Property / cites work @@
+A Nearly Linear-Time Approximation Scheme for the Euclidean <i>k</i>-Median Problem
+Normal rank
@@ Property / cites work @@
+Q4607907
@@ Property / cites work: Q4607907 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3191565
@@ Property / cites work: Q3191565 / rank @@
+Normal rank
@@ Property / cites work @@
+Co-clustering under the maximum norm
@@ Property / cites work: Co-clustering under the maximum norm / rank @@
+Normal rank
@@ Property / cites work @@
+NP-hardness of Euclidean sum-of-squares clustering
+Normal rank
@@ Property / cites work @@
+On the Complexity of Some Common Geometric Location Problems
+Normal rank
@@ Property / cites work @@
+The Planar k-Means Problem is NP-Hard
@@ Property / cites work: The Planar k-Means Problem is NP-Hard / rank @@
+Normal rank
@@ Property / cites work @@
+Q4607908
@@ Property / cites work: Q4607908 / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Low-Rank Binary Matrix Approximation
+Normal rank
@@ Property / cites work @@
+Consensus Patterns (Probably) Has no EPTAS
@@ Property / cites work: Consensus Patterns (Probably) Has no EPTAS / rank @@
+Normal rank
@@ Property / cites work @@
+Closest Substring Problems with Small Distances
@@ Property / cites work: Closest Substring Problems with Small Distances / rank @@
+Normal rank
@@ Property / cites work @@
+Color-coding
@@ Property / cites work: Color-coding / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Fundamentals of parameterized complexity
@@ Property / cites work: Fundamentals of parameterized complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Which problems have strongly exponential complexity?
+Normal rank
@@ Property / cites work @@
+Q4231923
@@ Property / cites work: Q4231923 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast probabilistic algorithms for Hamiltonian circuits and matchings
+Normal rank
@@ Property / DOI @@
+.1016/J.JCSS.2020.10.005
@@ Property / DOI: 10.1016/J.JCSS.2020.10.005 / rank @@
+Normal rank

Parameterized \(k\)-clustering: tractability island (Q2221803): Difference between revisions

Latest revision as of 14:24, 17 December 2024

Statements

Identifiers

Sitelinks

Mathematics(1 entry)