Cluster Deletion deterministic approximation algorithm via Strong Triadic Closure simplification and implementation for
N. Veldt, “Correlation Clustering via Strong Triadic Closure Labeling: Fast Approximation Algorithms and Practical Lower Bounds,” in Proceedings of the 39th International Conference on Machine Learning. PMLR, Jun. 2022, pp. 22 060–22 083. Available: https://proceedings.mlr.press/v162/veldt22a.html
Full report available: pdf
The graphs used are in the graphs folder.
The code for the algorithm is in cd.py.
To reproduce the results install the required packages:
pip install -r requirements.txt
Then run the following command:
python cd.py