Sparsest Cut Approximation Using Single Commodity Flows

Abstract

In this paper, we present an algorithm approximating the sparsest cut within a factor of O(log ² n) in Õ(m + n^3/2) time introduced by Khandekar, Rao and Vazirani in. While we explain the theoretical background and prove the claimed approximation factor and runtime, we add new visualization to improve the understandibility.