Parameterized complexity of categorical clustering with size constraints
From MaRDI portal
Publication:832880
Cites work
- A PTAS for ℓp-Low Rank Approximation
- A constant-factor approximation algorithm for the \(k\)-median problem
- Achieving anonymity via clustering
- An approximation algorithm for uniform capacitated \(k\)-median problem with \(1+\epsilon\) capacity violation
- Approximating \(k\)-median with non-uniform capacities
- Approximation Schemes for Low-rank Binary Matrix Approximation Problems
- Bi-factor approximation algorithms for hard capacitated \(k\)-median problems
- Closest Substring Problems with Small Distances
- Clustering with balancing constraints
- Color-coding
- Constant Time Generation of Free Trees
- Constant approximation for capacitated \(k\)-median with \((1+\epsilon)\)-capacity violation
- Kernelization. Theory of parameterized preprocessing
- On the fixed-parameter tractability of capacitated clustering
- On uniform capacitated \(k\)-median beyond the natural LP relaxation
- Parameterized \(k\)-clustering: tractability island
- Parameterized algorithms
- Parameterized low-rank binary matrix approximation
- Polynomial-time approximation schemes for geometric min-sum median clustering
- Privacy preserving clustering with constraints
- Segmentation problems
- The complexity of the single individual SNP haplotyping problem
- The number of trees
Cited in
(2)
This page was built for publication: Parameterized complexity of categorical clustering with size constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q832880)
