scientific article; zbMATH DE number 7561534
From MaRDI portal
Publication:5091191
DOI10.4230/LIPIcs.ICALP.2019.41MaRDI QIDQ5091191
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/abs/2208.14129
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
clusteringapproximation algorithmsfixed-parameter tractability\(k\)-means\(k\)-mediancapacitatedEuclideancore-sets
Related Items (14)
Parameterized complexity of categorical clustering with size constraints ⋮ Improved parameterized approximation for balanced \(k\)-median ⋮ Tight FPT approximation for socially fair clustering ⋮ Unnamed Item ⋮ A semi brute-force search approach for (balanced) clustering ⋮ A constant FPT approximation algorithm for hard-capacitated \(k\)-means ⋮ Parameterized complexity of categorical clustering with size constraints ⋮ A unified framework of FPT approximation algorithms for clustering problems ⋮ FPT Approximation for Constrained Metric k-Median/Means ⋮ Lossy kernelization of same-size clustering ⋮ Constant-Factor FPT Approximation for Capacitated k-Median ⋮ Lossy kernelization of same-size clustering ⋮ On parameterized approximation algorithms for balanced clustering ⋮ To close is easier than to open: dual parameterization to \(k\)-median
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Smaller coresets for \(k\)-median and \(k\)-means clustering
- A constant-factor approximation algorithm for the \(k\)-median problem
- Partitioning a graph into small pieces with applications to path transversal
- An Approximation Algorithm for Uniform Capacitated k-Median Problem with $$1+\epsilon $$ Capacity Violation
- Optimal Parameterized Algorithms for Planar Facility Location Problems Using Voronoi Diagrams
- On Coresets for k-Median and k-Means Clustering in Metric and Euclidean Spaces and Their Applications
- Linear-time approximation schemes for clustering problems in any dimensions
- On coresets for k-means and k-median clustering
- Approximation schemes for clustering problems
- Coresets in dynamic geometric data streams
- Approximating capacitated k-median with (1 + ∊)k open facilities
- On Uniform Capacitated k -Median Beyond the Natural LP Relaxation
- Approximation Schemes for Capacitated Clustering in Doubling Metrics
- Optimal terminal dimensionality reduction in Euclidean space
- Nonlinear dimension reduction via outer Bi-Lipschitz extensions
- Losing Treewidth by Separating Subsets
- On Uniform Capacitated k-Median Beyond the Natural LP Relaxation
- Bi-Factor Approximation Algorithms for Hard Capacitated k-Median Problems
This page was built for publication:
