Prefer a chat interface with context about you and your work?
A Simple Framework for Finding Balanced Sparse Cuts via APSP
We present a very simple and intuitive algorithm to find balanced sparse cuts in a graph via shortest-paths. Our algorithm combines a new multiplicative-weights framework for solving unit-weight multi-commodity flows with standard ball growing arguments.Using Dijkstra's algorithm for computing the shortest paths afresh every time gives a very simple algorithm …