Mohit Singh
—————————————————————————————————————————————————————————————————————————
I am a fifth year PhD student in ACO (Algorithms, Combinatorics and Optimization) at Tepper School of Business. My advisor is Prof. R. Ravi. I am interested in approximation algorithms and combinatorial optimization. Presently, I am working on approximation algorithms for degree bounded network design problems. I am also interested in approximation algorithms for stochastic optimization problems. ————————————————————————————————————————————————————————————————————————— Teaching 47-853 Special Topics in Combinatorial Optimization Thesis Iterative Methods in Combinatorial Optimization ————————————————————————————————————————————————————————————————————————— Publications 1. Lap Chi Lau and Mohit Singh, Additive Approximation for Bounded Degree Survivable Network Design, To Appear in 40th ACM Symposium on Theory of Computing, STOC 2008. 2. Tamas Kiraly, Lap Chi Lau and Mohit Singh, Degree Bounded Matroids and Submodular Flows, To Appear in 13th Conference on Integer Programming and Combinatorial Optimization, IPCO 2008. 3. Uriel Feige and Mohit Singh Improved Approximation Ratios for Traveling Salesperson Tours and Paths in Directed Graphs, Proceedings of 10th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2007. 4. Mohit Singh and Lap Chi Lau Approximating Minimum Bounded Degree Spanning Tress to within One of Optimal , Proceedings of 39th ACM Symposium on Theory of Computing, STOC 2007. 5. L.C. Lau, S. Naor, M. Salavatipour and M. Singh Survivable Network Design with Degree or Order Constraints, Proceedings of 39th ACM Symposium on Theory of Computing, STOC 2007. 6. R. Ravi and Mohit Singh, Delegate and Conquer: An LP-based Approximation Algorithms for Minimum Degree MSTs, Proceedings of 33rd International Colloquium on Automata, Languages and Programming, ICALP 2006: 169--180. 7. Daniel Golovin, Viswanath Nagarajan and Mohit Singh, Approximating the k-Multicut Problem, Proceedings of ACM-SIAM Symposium on Discrete Algorithms, SODA 2006: 621--630. 8. Kedar Dhamdere, Vineet Goyal, R. Ravi and Mohit Singh, How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems, Proceedings of 46th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2005: 367--378. 9. Kedar Dhamdere, R. Ravi and Mohit Singh, On Stochastic Minimum Spanning Trees, Proceedings of Eleventh Conference on Integer Programming and Combinatorial Optimization, IPCO 2005: 321--324. 10. Vittorio Bilo, Vineet Goyal, R. Ravi and Mohit Singh, On the Crossing Spanning Tree Problem, Proceedings of 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2004: 51--60. Latest Version.
|