Q5091191 (Q5091191): Difference between revisions

@@ Property / DOI @@
-.4230/LIPIcs.ICALP.2019.41
@@ Property / DOI: 10.4230/LIPIcs.ICALP.2019.41 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / cites work @@
+Q4542527
@@ Property / cites work: Q4542527 / rank @@
+Normal rank
@@ Property / cites work @@
+Bi-Factor Approximation Algorithms for Hard Capacitated <i>k</i>-Median Problems
+Normal rank
@@ Property / cites work @@
+An Approximation Algorithm for Uniform Capacitated k-Median Problem with $$1+\epsilon $$ Capacity Violation
+Normal rank
@@ Property / cites work @@
+Q4542528
@@ Property / cites work: Q4542528 / rank @@
+Normal rank
@@ Property / cites work @@
+A constant-factor approximation algorithm for the \(k\)-median problem
+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 @@
+Q2921763
@@ Property / cites work: Q2921763 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation Schemes for Capacitated Clustering in Doubling Metrics
+Normal rank
@@ Property / cites work @@
+Q4607908
@@ Property / cites work: Q4607908 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5091192
@@ Property / cites work: Q5091192 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation schemes for clustering problems
@@ Property / cites work: Approximation schemes for clustering problems / rank @@
+Normal rank
@@ Property / cites work @@
+Coresets in dynamic geometric data streams
@@ Property / cites work: Coresets in dynamic geometric data streams / rank @@
+Normal rank
@@ Property / cites work @@
+Q4608074
@@ Property / cites work: Q4608074 / rank @@
+Normal rank
@@ Property / cites work @@
+Losing Treewidth by Separating Subsets
@@ Property / cites work: Losing Treewidth by Separating Subsets / rank @@
+Normal rank
@@ Property / cites work @@
+Smaller coresets for \(k\)-median and \(k\)-means 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 @@
+Partitioning a graph into small pieces with applications to path transversal
+Normal rank
@@ Property / cites work @@
+On Uniform Capacitated <i>k</i>-Median Beyond the Natural LP Relaxation
+Normal rank
@@ Property / cites work @@
+Approximating capacitated <i>k</i>-median with (1 + ∊)<i>k</i> open facilities
+Normal rank
@@ Property / cites work @@
+On Uniform Capacitated             <i>k</i>             -Median Beyond the Natural LP Relaxation
+Normal rank
@@ Property / cites work @@
+Nonlinear dimension reduction via outer Bi-Lipschitz extensions
+Normal rank
@@ Property / cites work @@
+Optimal Parameterized Algorithms for Planar Facility Location Problems Using Voronoi Diagrams
+Normal rank
@@ Property / cites work @@
+Optimal terminal dimensionality reduction in Euclidean space
+Normal rank
@@ Property / DOI @@
+.4230/LIPICS.ICALP.2019.41
@@ Property / DOI: 10.4230/LIPICS.ICALP.2019.41 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5091191