CirCut

Extremely fast, scalable, Goemans-Williamson-quality heuristics for the maximum cut problem, maximum bisection problem, and other graph partitioning problems; maintained by Yin Zhang of Rice University. Click here.