Approximation schemes for Min-Sum k-Clustering
From MaRDI portal
Recommendations
- Approximation schemes for min-sum k-clustering
- Approximation algorithms for min-sum \(k\)-clustering and balanced \(k\)-median
- Approximation algorithms for min-sum \(k\)-clustering and balanced \(k\)-median
- Approximating min-sum k -clustering in metric spaces
- Approximation schemes for clustering problems
Cites work
- A (1+\varepsilon)-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs
- An Improved Approximation for k -Median and Positive Correlation in Budgeted Optimization
- Approximating min-sum k -clustering in metric spaces
- Approximation algorithms for min-sum \(k\)-clustering and balanced \(k\)-median
- Approximation algorithms for min-sum \(p\)-clustering
- Approximation schemes for clustering problems
- Bypassing the embedding
- scientific article; zbMATH DE number 1332666 (Why is no real title available?)
- scientific article; zbMATH DE number 7561535 (Why is no real title available?)
- scientific article; zbMATH DE number 7768361 (Why is no real title available?)
- scientific article; zbMATH DE number 7788494 (Why is no real title available?)
- P-Complete Approximation Problems
- Parallel Algorithms with Optimal Speedup for Bounded Treewidth
- Small Space Representations for Metric Min-Sum k-Clustering and Their Applications
This page was built for publication: Approximation schemes for Min-Sum \(k\)-Clustering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6670503)
