no code implementations • 10 Jul 2013 • Lorenzo Orecchia, Zeyuan Allen Zhu
A very elegant algorithm for this problem has been given by Andersen and Lang [AL08] and requires solving a small number of single-commodity maximum flow computations over the whole graph G. In this paper, we introduce LocalImprove, the first cut-improvement algorithm that is local, i. e. that runs in time dependent on the size of the input set A rather than on the size of the entire graph.
no code implementations • 30 Apr 2013 • Zeyuan Allen Zhu, Silvio Lattanzi, Vahab Mirrokni
We also prove that our analysis is tight, and perform empirical evaluation to support our theory on both synthetic and real data.
no code implementations • 18 Dec 2010 • Zeyuan Allen Zhu
To attain the best learning accuracy, people move on with difficulties and frustrations.