Publications
2014
- Samir Khuller, Manish Purohit, Kanthi K. Sarpatwar. Analyzing the Optimal Neighborhood: Algorithms for Budgeted and Partial Connected Dominating Set Problems. To appear in the Symposium on Discrete Algorithms (SODA 2014)(pdf, slides).
-
Joel Wolf, Zubair Nabi, Viswanath Nagarajan, Robert Saccone, Rohit Wagle, Kirsten Hildrum, Edward Pring and Kanthi Sarpatwar.
The X-Flex Cross-Platform Scheduler: Who's The Fairest Of Them All? To appear in the ACM/IFIP/USENIX Middleware 2014 - Industry Track.
-
Samir Khuller, Manish Purohit, Kanthi K. Sarpatwar. Approximation Algorithms for Covering Problems in Energy Constrained Wireless Networks. Submitted.
- Randeep Bhatia, Kanthi K. Sarpatwar. Fast Processing of Graph Queries Over Large Networks via Distance Oracles. Submitted.
2013
-
Kanthi K. Sarpatwar. A Constant Approximation Algorithm for the k-All-or-Nothing Generalized Assignment Problem.
2012
- Samir Khuller, Barna Saha, Kanthi K. Sarpatwar. New Approximation Results for Resource Replication Problems. Proc. of the 15th International Workshop on Approximation Algorithms for Combinatorial Optimization Algorithms. (APPROX-RANDOM 2012)(pdf, slides).
2011
- Prabhanjan Ananth, Meghana Nasre, Kanthi K. Sarpatwar. Rainbow Connectivity; Hardness and Tractability. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)(pdf).
- Kanthi K. Sarpatwar, Narayanaswamy N. S. Hardness of Subgraph and Supergraph Problems in r-tournaments. Theoretical Computer Science (TCS 2011)(pdf, slides).