Graph Theory. Implementation of greedy algorithm to approximate k centeriods. The algorithm is 2-approximate and runs at a polynomial time complexity.
-
Updated
Jun 13, 2022 - C++
Graph Theory. Implementation of greedy algorithm to approximate k centeriods. The algorithm is 2-approximate and runs at a polynomial time complexity.
Add a description, image, and links to the clustring topic page so that developers can more easily learn about it.
To associate your repository with the clustring topic, visit your repo's landing page and select "manage topics."