- A Randomized Rounding Approach to the Traveling Salesman Problem, Shayan Oveis Gharan, Amin Saberi and Mohit Singh, Preprint, December 2010, Updated April, 2011.
- Online Node-weighted Steiner Tree and Related Problems. Seffi Naor, Debmalya Panigrahy and Mohit Singh, Submitted, 2010.
-
Approximation Algorithms for Online Submodular Function Maximization subject to a Matroid Constraint. Niv Buchbinder, Seffi Naor, R. Ravi and Mohit Singh, Submitted, 2010.
-
Incentives in Online Auctions via Linear Programming. Niv Buchbinder, Kamal Jain and Mohit Singh, In Proceedings of Sixth Workshop on Internet and Network Economics (WINE), 2010.
-
Improving Integrality Gaps via Chvatal-Gomory Rounding. Mohit Singh and Kunal Talwar, In Proceedings of the 13th Intl. Workshop on Approximation Algorithms for Combinatorial Optimization Problems - APPROX 2010.
- Secretary Problems via Linear Programming. Niv Buchbinder, Kamal Jain and Mohit Singh, To Appear In Proceedings of the 14th Conference on Integer Programming and Combinatorial Optimization (IPCO), 2010.
- Deploying Mesh Nodes under Non-Uniform Propagation. Joshua Robinson, Mohit Singh, R. Swaminathan, and E. Knightly, To Appear in Proceedings of IEEE INFOCOM 2010, San Diego, CA, March 2010.
- Iterative Rounding for Multi-Objective Optimization Problems. Fabrizio Grandoni, R. Ravi, Mohit Singh, In Proceedings of European Symposium of Algorithms, ESA 2009: 95-106.
- Set Covering with Our Eyes Closed. Fabrizio Grandoni, Anupam Gupta, Stefano Leonardi, Pauli Miettinen, Piotr Sankowski and Mohit Singh, In Proceedings of 49th Annual Symposium on Foundations of Computer Science Conference, FOCS 2008: 347-356.
- Edge Coloring and Decompositions of Weighted Graphs. Uriel Feige and Mohit Singh, In Proceedings of European Symposium of Algorithms, ESA 2008: 405-416.
- Additive Approximation for Bounded Degree Survivable Network Design. Lap Chi Lau and Mohit Singh, In Proceedings of 40th ACM Symposium on Theory of Computing, STOC 2008: 759-768.
- Degree Bounded Matroids and Submodular Flows. Tamas Kiraly, Lap Chi Lau and Mohit Singh, In Proceedings of 13th Conference on Integer Programming and Combinatorial Optimization, IPCO 2008: 259-272.
- Improved Approximation Ratios for Traveling Salesman Tours and Paths in Directed Graphs. Uriel Feige and Mohit Singh, In Proceedings of 10th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2007: 104-118.
- Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal. Mohit Singh and Lap Chi Lau, In Proceedings of 39th ACM Symposium on Theory of Computing, STOC 2007: 661-670.
- Survivable Network Design with Degree or Order Constraints. Lap Chi Lau, S. Naor, M. Salavatipour and M. Singh, In Proceedings of 39th ACM Symposium on Theory of Computing, STOC 2007: 651-660. Journal Version SIAM Journal of Computing, Volume 39, Issue 3, 2009: 1062-1087.
- Delegate and Conquer: An LP-based Approximation Algorithms for Minimum Degree MSTs. R. Ravi and Mohit Singh, In Proceedings of 33rd International Colloquium on Automata, Languages and Programming, ICALP 2006: 169--180.
- Approximating the k-Multicut Problem. Daniel Golovin, Viswanath Nagarajan and Mohit Singh, In Proceedings of ACM-SIAM Symposium on Discrete Algorithms, SODA 2006: 621--630.
- How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems. Kedar Dhamdere, Vineet Goyal, R. Ravi and Mohit Singh, In Proceedings of 46th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2005: 367--378.
- On Stochastic Minimum Spanning Trees. Kedar Dhamdere, R. Ravi and Mohit Singh, In Proceedings of Eleventh Conference on Integer Programming and Combinatorial Optimization, IPCO 2005: 321--324.
- On the Crossing Spanning Tree Problem,. Vittorio Bilo, Vineet Goyal, R. Ravi and Mohit Singh, In Proceedings of 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2004: 51--60. Latest Version.
|