My research interests are chiefly in approximation algorithms, especially for graph-theoretic problems and clustering problems. I am also interested in models which incorporate uncertainty in the input such as online algorithms and stochastic optimization.
I am a researcher in the Foundations group at MSR India. Prior to this, I was a Simons Postdoctoral Fellow at the Computer Science Department, Princeton University. In 2012, I completed my PhD at CMU where I was fortunate to have Anupam Gupta as my advisor. Long ago, I was an undergrad at IIT Madras.
I am broadly interested in basic problems in algorithms and optimization. I typically work in the area of approximation algorithms for graph-theoretic and clustering problems. Often, I deal with models which incorporate an element of uncertainty, such as online arrivals or stochastic inputs.
A more complete list of my publications is available here at my external homepage.
Cluster Before You Hallucinate: Approximating Node-capacitated Network Design and Energy Efficient RoutingRavishankar Krishnaswamy, Viswanath Nagarajan, Kirk Pruhs, Cliff Stein, in Proceedings of the 46th Annual ACM Symposium on Theory of Computing, ACM, May 1, 2014,
February 15, 2012
Carnegie Mellon University