graph partitioning

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
Flow-Based Algorithms for Local Graph Clustering
Zeyuan Allen-Zhu, Lorenzo Orecchia
ArXiv SIAM
Fast Approximation Algorithms for Graph Partitioning Using Spectral and Semidefinite-Programming Techniques
UCB TR
Towards an SDP-Based Approach to Spectral Methods: A Nearly-Linear Time Algorithm for Graph Partitioning and Decomposition
Lorenzo Orecchia, Nisheeth K. Vishnoi
ACM
Empirical Evaluation of Graph Partitioning Using Spectral Embeddings and Flow
Kevin J. Lang, Michael W. Mahoney,
Springer LNTCS
On Partitioning Graphs via Single Commodity Flows
Lorenzo Orecchia, Leonard Schulman, Umesh V. Vazirani, Nisheeth K. Vishnoi
ACM
On a Cut-Matching Game for the Sparsest Cut Problem
Rohit Khandekar, Subhash A. Khot, Nisheeth K. Vishnoi, Lorenzo Orecchia
UCB TR