vlsi layout-5
Fast approximation algorithms for cut-based problems in undirected graphs
FREE-DOWNLOAD [PDF] A Madry – 2010 research 51st Annual Symposium on Foundations of …,
They have been extensively studied – both from theoretical and applied perspective – in the
context of flow problems, theory of Markov chains, geometric em- beddings, clustering, community
detection, VLSI layout design, and as a basic primitive for divide-and-conquer