Lossy kernelization of same-size clustering
From MaRDI portal
Publication:6174654
DOI10.1007/s00224-023-10129-9MaRDI QIDQ6174654
Sayan Bandyapadhyay, Nidhi Purohit, Petr A. Golovach, Fedor V. Fomin, Kirill Simonov
Publication date: 17 August 2023
Published in: Theory of Computing Systems (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fundamentals of parameterized complexity
- Parameterized complexity of categorical clustering with size constraints
- Computational intelligence paradigms. Innovative applications
- The hardness of approximation: Gap location
- Faster algorithms for the constrained \(k\)-means problem
- A constant-factor approximation algorithm for the \(k\)-median problem
- On the parameterized complexity of contraction to generalization of trees
- Parameterized low-rank binary matrix approximation
- A unified framework for clustering constrained data without locality property
- Approximating $k$-Median via Pseudo-Approximation
- An Approximation Algorithm for Uniform Capacitated k-Median Problem with $$1+\epsilon $$ Capacity Violation
- Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Constrained Clustering
- Linear-time approximation schemes for clustering problems in any dimensions
- On coresets for k-means and k-median clustering
- Local Search Yields a PTAS for $k$-Means in Doubling Metrics
- Local Search Yields Approximation Schemes for $k$-Means and $k$-Median in Euclidean and Minor-Free Metrics
- Lossy Kernels for Graph Contraction Problems
- Kernelization
- k-ANONYMITY: A MODEL FOR PROTECTING PRIVACY
- On Two Segmentation Problems
- An Improved Approximation for k -Median and Positive Correlation in Budgeted Optimization
- On Uniform Capacitated k -Median Beyond the Natural LP Relaxation
- Lossy kernelization
- Better Guarantees for $k$-Means and Euclidean $k$-Median by Primal-Dual Algorithms
- Approximation Schemes for Capacitated Clustering in Doubling Metrics
- Lossy Kernels for Connected Dominating Set on Sparse Graphs
- On Uniform Capacitated k-Median Beyond the Natural LP Relaxation
- Bi-Factor Approximation Algorithms for Hard Capacitated k-Median Problems
- A unified framework for approximating and clustering data
- Parameterized Algorithms
- Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices
- A unified framework of FPT approximation algorithms for clustering problems
This page was built for publication: Lossy kernelization of same-size clustering
