| Approximating minimum bounded degree spanning trees to within one of optimal M Singh, LC Lau Journal of the ACM (JACM) 62 (1), 1-19, 2015 | 258 | 2015 |
| Iterative methods in combinatorial optimization LC Lau, R Ravi, M Singh Cambridge University Press, 2011 | 253 | 2011 |
| A randomized rounding approach to the traveling salesman problem SO Gharan, A Saberi, M Singh 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, 550-559, 2011 | 209 | 2011 |
| A geometric alternative to Nesterov's accelerated gradient descent S Bubeck, YT Lee, M Singh arXiv preprint arXiv:1506.08187, 2015 | 198 | 2015 |
| The price of fair pca: One extra dimension S Samadi, U Tantipongpipat, JH Morgenstern, M Singh, S Vempala Advances in neural information processing systems 31, 2018 | 193 | 2018 |
| Survivable network design with degree or order constraints LC Lau, J Naor, MR Salavatipour, M Singh SIAM Journal on Computing 39 (3), 1062-1087, 2009 | 162 | 2009 |
| LP-based algorithms for capacitated facility location HC An, M Singh, O Svensson SIAM Journal on Computing 46 (1), 272-306, 2017 | 155 | 2017 |
| How to pay, come what may: Approximation algorithms for demand-robust covering problems K Dhamdhere, V Goyal, R Ravi, M Singh 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05), 367-376, 2005 | 101 | 2005 |
| Entropy, optimization and counting M Singh, NK Vishnoi Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014 | 88 | 2014 |
| Nash social welfare, matrix permanent, and stable polynomials N Anari, SO Gharan, A Saberi, M Singh arXiv preprint arXiv:1609.07056, 2016 | 84 | 2016 |
| Improved approximation ratios for traveling salesperson tours and paths in directed graphs U Feige, M Singh Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2007 | 83 | 2007 |
| Online node-weighted steiner tree and related problems J Naor, D Panigrahi, M Singh 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, 210-219, 2011 | 72 | 2011 |
| On two-stage stochastic minimum spanning trees K Dhamdhere, R Ravi, M Singh Integer Programming and Combinatorial Optimization: 11th International IPCO …, 2005 | 69 | 2005 |
| Proportional Volume Sampling and Approximation Algorithms for -Optimal Design A Nikolov, M Singh, U Tantipongpipat Mathematics of Operations Research 47 (2), 847-877, 2022 | 67 | 2022 |
| Sharing buffer pool memory in multi-tenant relational database-as-a-service V Narasayya, I Menache, M Singh, F Li, M Syamala, S Chaudhuri Proceedings of the VLDB Endowment 8 (7), 726-737, 2015 | 63 | 2015 |
| New approaches to multi-objective optimization F Grandoni, R Ravi, M Singh, R Zenklusen Mathematical Programming 146, 525-554, 2014 | 63 | 2014 |
| Approximating the k-multicut problem D Golovin, V Nagarajan, M Singh SODA 6, 621-630, 2006 | 59 | 2006 |
| Degree bounded matroids and submodular flows T Király, LC Lau, M Singh Combinatorica 32 (6), 703-720, 2012 | 58* | 2012 |
| Efficient algorithms for discrepancy minimization in convex sets R Eldan, M Singh Random Structures & Algorithms 53 (2), 289-307, 2018 | 57 | 2018 |
| Additive approximation for bounded degree survivable network design LC Lau, M Singh Proceedings of the fortieth annual ACM symposium on Theory of computing, 759-768, 2008 | 55 | 2008 |
R RaviCarnegie Mellon Unviersityandrew.cmu.edu의 이메일 확인됨
