Search the dblp DataBase

Publications of Author

1. Vittorio Bilò, Vineet Goyal, R. Ravi, Mohit Singh
   On the Crossing Spanning Tree Problem. [Citation Graph (0, 0)][DBLP]
   APPROX-RANDOM, 2004, pp:51-60 [Conf]
   
2. Kedar Dhamdhere, Vineet Goyal, R. Ravi, Mohit Singh
   How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems. [Citation Graph (0, 0)][DBLP]
   FOCS, 2005, pp:367-378 [Conf]
   
3. R. Ravi, Mohit Singh
   Delegate and Conquer: An LP-Based Approximation Algorithm for Minimum Degree MSTs. [Citation Graph (0, 0)][DBLP]
   ICALP (1), 2006, pp:169-180 [Conf]
   
4. Kedar Dhamdhere, R. Ravi, Mohit Singh
   On Two-Stage Stochastic Minimum Spanning Trees. [Citation Graph (0, 0)][DBLP]
   IPCO, 2005, pp:321-334 [Conf]
   
5. Daniel Golovin, Viswanath Nagarajan, Mohit Singh
   Approximating the k-multicut problem. [Citation Graph (0, 0)][DBLP]
   SODA, 2006, pp:621-630 [Conf]
   
6. Mohit Singh, Amitabha Tripathi
   On an extremal problem related to a theorem of Whitney. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2007, v:155, n:4, pp:579-583 [Journal]
   
7. Uriel Feige, Mohit Singh
   Improved Approximation Ratios for Traveling Salesperson Tours and Paths in Directed Graphs. [Citation Graph (0, 0)][DBLP]
   APPROX-RANDOM, 2007, pp:104-118 [Conf]
   
8. Lap Chi Lau, Joseph Naor, Mohammad R. Salavatipour, Mohit Singh
   Survivable network design with degree or order constraints. [Citation Graph (0, 0)][DBLP]
   STOC, 2007, pp:651-660 [Conf]
   
9. Mohit Singh, Lap Chi Lau
   Approximating minimum bounded degree spanning trees to within one of optimal. [Citation Graph (0, 0)][DBLP]
   STOC, 2007, pp:661-670 [Conf]
   
10. 
    Improving Integrality Gaps via Chvátal-Gomory Rounding. [Citation Graph (, )][DBLP]
    
    
11. 
    Edge Coloring and Decompositions of Weighted Graphs. [Citation Graph (, )][DBLP]
    
    
12. 
    Iterative Rounding for Multi-Objective Optimization Problems. [Citation Graph (, )][DBLP]
    
    
13. 
    Set Covering with our Eyes Closed. [Citation Graph (, )][DBLP]
    
    
14. 
    Deploying Mesh Nodes under Non-Uniform Propagation. [Citation Graph (, )][DBLP]
    
    
15. 
    Degree Bounded Matroids and Submodular Flows. [Citation Graph (, )][DBLP]
    
    
16. 
    Secretary Problems via Linear Programming. [Citation Graph (, )][DBLP]
    
    
17. 
    Additive approximation for bounded degree survivable network design. [Citation Graph (, )][DBLP]
    
    
18. 
    A Randomized Rounding Algorithm for the Asymmetric Traveling Salesman Problem [Citation Graph (, )][DBLP]