Gaurav  Agarwal

 
 

My research interests include algorithms, machine learning and mathematical optimization. I have worked with Professor David Kempe at University of Southern California in the field of graph clustering to develop approximate algorithms for clustering using Linear and Vector programming based optimization techniques .


I have also worked with Professor Patrick Pantel (now at Yahoo! Research) at the University of Southern California's Information Sciences Institute on parallel implementations of a few NLP applications using Map Reduce methodology.


Email: gaurava at usc dot edu



Resources

If you are looking for the source code for the LP and VP rounding programs used for detecting communities in the paper 'Modularity-Maximizing Graph Communities via Mathematical Programming', you can get it here. You can get all the data-sets used in the same paper from here.


Research Papers

  1. • K.V.Dinesha, P.C.P. Bhatt, Gaurav Agarwal : On Efficient Algorithms for the Number Partitioning Problem

  2. • Gaurav Agarwal, David Kempe : Modularity-Maximizing Graph Communities via Mathematical Programming - European Physics Journal B, Vol 66/3, 12/2008 [pdf]

 
The University of Southern California does not screen or control the content on this website and thus does not guarantee the accuracy, integrity, or quality of such content. All content on this website is provided by and is the sole responsibility of the person from which such content originated, and such content does not necessarily reflect the opinions of the University administration or the Board of Trustees