Showing 2017Show all
2 papers · 1 filter
cs.DS2017
Graph Clustering using Effective Resistance
Vedat Levi Alev, Nima Anari, Lap Chi Lau +1
We design a polynomial time algorithm that for any weighted undirected graph $G = (V, E,\vecc w)$ and sufficiently large , partitions into…
cs.DS2017
Approximating Unique Games Using Low Diameter Graph Decomposition
Vedat Levi Alev, Lap Chi Lau
We design approximation algorithms for Unique Games when the constraint graph admits good low diameter graph decomposition. For the problem in -minor free gr…