Approximation Algorithms for Matroid and Knapsack Means Problems
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 6381735 (Why is no real title available?)
- A dependent LP-rounding approach for the k-median problem
- A local search approximation algorithm for \(k\)-means clustering
- Adaptive Sampling for k-Means Clustering
- Approximation algorithms for the robust facility leasing problem
- Approximation algorithms for two variants of correlation clustering problem
- Improved approximation algorithms for matroid and knapsack median problems and applications
- Least squares quantization in PCM
- Local search algorithms for the red-blue median problem
- Small Space Stream Summary for Matroid Center
- The bi-criteria seeding algorithms for two variants of \(k\)-means problem
- The matroid median problem
- The seeding algorithm for k-means problem with penalties
- The seeding algorithm for spherical \(k\)-means clustering with penalties
Cited in
(2)
This page was built for publication: Approximation Algorithms for Matroid and Knapsack Means Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6053494)