Skip to content. Skip to navigation
McGill Home SOCS Home
Personal tools
You are here: Home People Profile

Mohit Singh


photo

Email: mohit@cs.mcgill.ca
Home Page: http://www.cs.mcgill.ca/~mohit
Office: MC324
Phone: +1-514-398-7082
Fax: +1-514-398-3883
Address:
McConnell Engineering Building, Room 324. McGill University, 3480 University Street, Montreal, Quebec, Canada H3A 2A7

Research Description

My research is in combinatorial optimization, approximation algorithms and optimization under uncertainty.

Research Interests

Research Labs

Teaching

Selected Publications (click link in front of each publication to see bibtex in ASCII format)

[1] Grandoni, F., Ravi, R., and Singh, M. Iterative rounding for multi-objective optimization problems. In Proceedings of European Symposium of Algorithms, ESA, 2009, pp. 95-106.
[2] Lau, L. C., Seffi Naor, M. S., and Singh, M. Survivable network design with degree or order constraints. SIAM Journal of Computing, 2009, v. 39, n. 3.
[3] Grandoni, F., Gupta, A., Leonardi, S., Miettinen, P., Sankowski, P., and Singh, M. Set covering with our eyes closed. In Proceedings of 49th Annual Symposium on Foundations of Computer Science Conference (FOCS), 2008, pp. 347-356.
[4] Feige, U., and Singh, M. Edge coloring and decompositions of weighted graphs. In Proceedings of European Symposium of Algorithms, ESA, 2008, pp. 405-416.
[5] Lau, L. C., and Singh, M. Additive approximation for bounded degree survivable network design. In Proceedings of 40th ACM Symposium on Theory of Computing, STOC, 2008, pp. 759-768.
[6] Kiraly, T., Lau, L. C., and Singh, M. Degree bounded matroids and submodular flows. In Proceedings of 13th Conference on Integer Programming and Combinatorial Optimization, IPCO, 2008, pp. 259-272.
[7] Feige, U., and Singh, M. Improved approximation ratios for traveling salesman tours and paths in directed graphs. In Proceedings of 10th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX, 2007, pp. 104-118.
[8] Singh, M., and Lau, L. C. Approximating minimum bounded degree spanning trees to within one of optimal. In Proceedings of 39th ACM Symposium on Theory of Computing, STOC, 2007, pp. 661-670.
[9] Lau, L. C., Naor, S., Salavatipour, M., and Singh, M. Survivable network design with degree or order constraints. In Proceedings of 39th ACM Symposium on Theory of Computing, STOC, 2007, pp. 651-660.
[10] Ravi, R., and Singh, M. Delegate and conquer: An lp-based approximation algorithms for minimum degree msts. In Proceedings of 33rd International Colloquium on Automata, Languages and Programming, ICALP, 2006, pp. 169-180.
[11] Golovin, D., Nagarajan, V., and Singh, M. Approximating the k-multicut problem. In Proceedings of ACM-SIAM Symposium on Discrete Algorithms, SODA, 2006, pp. 621-630.
[12] Dhamdere, K., Goyal, V., Ravi, R., and Singh, M. How to pay, come what may: Approximation algorithms for demand-robust covering problems. In Proceedings of 46th Annual IEEE Symposium on Foundations of Computer Science, FOCS, 2005, pp. 367-378.
[13] Bilo, V., Goyal, V., Ravi, R., and Singh, M. On the crossing spanning tree problem. In Proceedings of 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX, 2004, pp. 51-60.

Last Update:   2012/08/30 09:52:18.885 GMT-4