A linear-time k-center algorithm with fairness conditions and worst-case guarantees that is very fast in practice. Written in Rust with Python bindings.
optimization publication operations-research fairness icml graph-algorithm matching-algorithm linear-time k-centers
-
Updated
Feb 12, 2024 - Rust