Approximation Algorithms for Aversion k-Clustering via Local k-Median
From MaRDI portal
Publication:4598205
Recommendations
- Approximation algorithms for min-sum \(k\)-clustering and balanced \(k\)-median
- Approximation algorithms for min-sum \(k\)-clustering and balanced \(k\)-median
- A local search approximation algorithm for \(k\)-means clustering
- A local search approximation algorithm for \(k\)-means clustering
- Polynomial-time approximation schemes for geometric min-sum median clustering
- Learning Theory
- Attainable accuracy guarantee for the \(k\)-medians clustering in [0, 1]
- scientific article; zbMATH DE number 2165699
- \(k\)-median clustering under discrete Fréchet and Hausdorff distances
Cited in
(5)- Connected \(k\)-center and \(k\)-diameter clustering
- An improved approximation algorithm for squared metric \(k\)-facility location
- Local Search Yields Approximation Schemes for $k$-Means and $k$-Median in Euclidean and Minor-Free Metrics
- Improved approximation algorithms for solving the squared metric \(k\)-facility location problem
- Attainable accuracy guarantee for the \(k\)-medians clustering in [0, 1]
This page was built for publication: Approximation Algorithms for Aversion k-Clustering via Local k-Median
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4598205)
