cut-matching game

Submodular Hypergraph Partitioning: Metric Relaxations and Fast Algorithms via an Improved Cut-Matching Game
Konstantinos Ameranis, Antares Chen, Lorenzo Orecchia, Erasmo Tani
ArXiv
Practical Almost-Linear-Time Approximation Algorithms for Hybrid and Overlapping Graph Clustering
Lorenzo Orecchia, Konstantinos Ameranis, Kunal Talwar, Charalampos Tsourakakis
ICML Slides PMLR