The SCEAS System
| |||||||

## Search the dblp DataBase
Mohit Singh:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- 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] - 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] - 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] - Kedar Dhamdhere, R. Ravi, Mohit Singh
**On Two-Stage Stochastic Minimum Spanning Trees.**[Citation Graph (0, 0)][DBLP] IPCO, 2005, pp:321-334 [Conf] - Daniel Golovin, Viswanath Nagarajan, Mohit Singh
**Approximating the**[Citation Graph (0, 0)][DBLP]*k*-multicut problem. SODA, 2006, pp:621-630 [Conf] - 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] - 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] - 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] - 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] **Improving Integrality Gaps via Chvátal-Gomory Rounding.**[Citation Graph (, )][DBLP]**Edge Coloring and Decompositions of Weighted Graphs.**[Citation Graph (, )][DBLP]**Iterative Rounding for Multi-Objective Optimization Problems.**[Citation Graph (, )][DBLP]**Set Covering with our Eyes Closed.**[Citation Graph (, )][DBLP]**Deploying Mesh Nodes under Non-Uniform Propagation.**[Citation Graph (, )][DBLP]**Degree Bounded Matroids and Submodular Flows.**[Citation Graph (, )][DBLP]**Secretary Problems via Linear Programming.**[Citation Graph (, )][DBLP]**Additive approximation for bounded degree survivable network design.**[Citation Graph (, )][DBLP]**A Randomized Rounding Algorithm for the Asymmetric Traveling Salesman Problem**[Citation Graph (, )][DBLP]
Search in 0.004secs, Finished in 0.005secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |