Lossy kernelization of same-size clustering
type: Item
instance of: scholarly article
title: Lossy kernelization of same-size clustering
DOI: 10.1007/978-3-031-09574-0_7
author: Sayan Bandyapadhyay
author: Fedor V. Fomin
author: Nidhi Purohit
author: Kirill Siminov
author: Petr A. Golovach
publication date: 2022-11-11T00:00:00Z
full work available at URL: https://arxiv.org/abs/2107.07383
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7615733
zbMATH Keywords: k-median clustering
zbMATH Keywords: parameterized approximation
zbMATH Keywords: kernelization
zbMATH Keywords: lossy kernels
MaRDI profile type: Publication
OpenAlex ID: W3180426741
cites work: On the Parameterized Complexity of Contraction to Generalization of Trees.
cites work: Better Guarantees for $k$-Means and Euclidean $k$-Median by Primal-Dual Algorithms
cites work: On Two Segmentation Problems
cites work: Q4542527
cites work: Q3132847
cites work: Constrained Clustering
cites work: Faster algorithms for the constrained \(k\)-means problem
cites work: Bi-Factor Approximation Algorithms for Hard Capacitated k-Median Problems
cites work: An Improved Approximation for k -Median and Positive Correlation in Budgeted Optimization
cites work: An Approximation Algorithm for Uniform Capacitated k-Median Problem with $$1+\epsilon $$ Capacity Violation
cites work: A constant-factor approximation algorithm for the \(k\)-median problem
cites work: Approximating \(k\)-median with non-uniform capacities
cites work: Approximation Schemes for Capacitated Clustering in Doubling Metrics
cites work: Q5091192
cites work: Local Search Yields Approximation Schemes for $k$-Means and $k$-Median in Euclidean and Minor-Free Metrics
cites work: Q5091191
cites work: Q5368697
cites work: Q4607908
cites work: Parameterized Algorithms
cites work: Q5743378
cites work: Q4598213
cites work: A unified framework for clustering constrained data without locality property
cites work: Fundamentals of parameterized complexity
cites work: Q3304124
cites work: Lossy Kernels for Connected Dominating Set on Sparse Graphs
cites work: A unified framework for approximating and clustering data
cites work: Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering
cites work: A unified framework of FPT approximation algorithms for clustering problems
cites work: Parameterized low-rank binary matrix approximation
cites work: Kernelization
cites work: Local Search Yields a PTAS for $k$-Means in Doubling Metrics
cites work: On coresets for k-means and k-median clustering
cites work: Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
cites work: Lossy Kernels for Graph Contraction Problems
cites work: Linear-time approximation schemes for clustering problems in any dimensions
cites work: On Uniform Capacitated k -Median Beyond the Natural LP Relaxation
cites work: Approximating \(k\)-median via pseudo-approximation
cites work: Lossy kernelization
cites work: Q5111409
cites work: The hardness of approximation: Gap location
cites work: k-ANONYMITY: A MODEL FOR PROTECTING PRIVACY
description: scientific article; zbMATH DE number 7615733