Mohit Singh
Mohit Singh
Associate Professor, Georgia Institute of Technology
Verifierad e-postadress på gatech.edu - Startsida
Titel
Citeras av
Citeras av
År
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
2122015
Iterative methods in combinatorial optimization
LC Lau, R Ravi, M Singh
Cambridge University Press, 2011
1472011
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
1442009
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
1392011
A geometric alternative to Nesterov's accelerated gradient descent
S Bubeck, YT Lee, M Singh
arXiv preprint arXiv:1506.08187, 2015
1012015
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
842005
LP-based algorithms for capacitated facility location
HC An, M Singh, O Svensson
SIAM Journal on Computing 46 (1), 272-306, 2017
762017
Improved approximation ratios for traveling salesperson tours and paths in directed graphs
U Feige, M Singh
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2007
622007
On two-stage stochastic minimum spanning trees
K Dhamdhere, R Ravi, M Singh
International Conference on Integer Programming and Combinatorial …, 2005
562005
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
532008
Approximating the k-multicut problem
D Golovin, V Nagarajan, M Singh
SODA 6, 621-630, 2006
482006
Entropy, optimization and counting
M Singh, NK Vishnoi
Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014
462014
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
432011
New approaches to multi-objective optimization
F Grandoni, R Ravi, M Singh, R Zenklusen
Mathematical Programming 146 (1-2), 525-554, 2014
402014
Iterative rounding for multi-objective optimization problems
F Grandoni, R Ravi, M Singh
European Symposium on Algorithms, 95-106, 2009
372009
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
352015
Set covering with our eyes closed
F Grandoni, A Gupta, S Leonardi, P Miettinen, P Sankowski, M Singh
2008 49th Annual IEEE Symposium on Foundations of Computer Science, 347-356, 2008
352008
Delegate and conquer: An LP-based approximation algorithm for minimum degree MSTs
R Ravi, M Singh
International Colloquium on Automata, Languages, and Programming, 169-180, 2006
332006
Secretary problems via linear programming
N Buchbinder, K Jain, M Singh
International Conference on Integer Programming and Combinatorial …, 2010
322010
Degree bounded matroids and submodular flows
T Király, LC Lau, M Singh
International Conference on Integer Programming and Combinatorial …, 2008
312008
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–20