7 projects
k-center
Rust-accelerated implementations of the k-center (and k-supplier) problem.
kmsr
kMSR provides a selection of algorithms to solve the k-Min-Sum-Radii problem.
bico
BICO is a fast streaming algorithm to compute coresets for the k-means problem on very large sets of points.
exact-kmeans
Computes an optimal k-means solution for small instances and small k.
connected-k-center
Implementations of algorithms for connected k-center on path graphs.
flspp
Implementation of the FLS++ algorithm for K-Means clustering.
fair-kmeans
Fair K-Means produces a fair clustering assignment according to the fairness definition of Chierichetti et al. Each point has a binary color, and the goal is to assign the points to clusters such that the number of points with different colors in each cluster is the same and the cost of the clusters is minimized.
