View Document Preview and Link Document Date: 2013-09-11 13:19:18 Open Document File Size: 712,50 KB Share Result on Facebook
City Rabinovich / Linial / London / / Company ACM Inc. / / Currency USD / / Facility Princeton University / / IndustryTerm faster algorithm / idea underlying algorithms / pseudo-approximation algorithm / approximation algorithm / dual solutions / different algorithm / prior algorithms / log n-approximation algorithms / good approximation algorithms / polynomial-time algorithm / combinatorial algorithm / randomized polynomial-time algorithm / commodity maximum flow algorithm / copyright/server / clever accounting scheme / primal-dual algorithm / approximation algorithms / / Organization Computer Science Division / National Science Foundation / S. Rao Computer Science Division / UC Berkeley / Institute for Advanced Study / Princeton University / Computer Science Department / / Person MAX-CUT / Williamson / SANJEEV ARORA / Lang / Lucille Packard / SATISH RAO / David Packard / Leighton / / Position Author / Graph Algorithms General / / Product CCR / / PublishedMedium Journal of the ACM / Theory of Computing / / Technology SDP-based approximation algorithms / faster algorithm / LP-inspired algorithm / SDP-based algorithm / combinatorial algorithm / Leighton-Rao algorithm / primal-dual algorithm / SDP-inspired algorithm / approximation algorithm / different algorithm / pseudo-approximation algorithm / polynomial-time algorithm / randomized polynomial-time algorithm / log n-approximation algorithms / approximation algorithms / SDP-based algorithms / commodity maximum flow algorithm / key idea underlying algorithms / good approximation algorithms / two algorithms / / URL www.cs.berkeley.edu/∼vazirani / www.cs.princeton.edu/∼arora / www.cs.berkeley.edu/∼satishr / / SocialTag 
Expander Flows, Geometric Embeddings and Graph Partitioning SANJEEV ARORA Princeton University SATISH RAO and UMESH VAZIRANI