dblp.uni-trier.dewww.uni-trier.de

Mohit Singh Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2009
16EEFabrizio Grandoni, R. Ravi, Mohit Singh: Iterative Rounding for Multi-Objective Optimization Problems. ESA 2009: 95-106
15EEMichel X. Goemans, Nicholas J. A. Harvey, Kamal Jain, Mohit Singh: A Randomized Rounding Algorithm for the Asymmetric Traveling Salesman Problem CoRR abs/0909.0941: (2009)
2008
14EEUriel Feige, Mohit Singh: Edge Coloring and Decompositions of Weighted Graphs. ESA 2008: 405-416
13EEFabrizio Grandoni, Anupam Gupta, Stefano Leonardi, Pauli Miettinen, Piotr Sankowski, Mohit Singh: Set Covering with our Eyes Closed. FOCS 2008: 347-356
12EETamás Király, Lap Chi Lau, Mohit Singh: Degree Bounded Matroids and Submodular Flows. IPCO 2008: 259-272
11EELap Chi Lau, Mohit Singh: Additive approximation for bounded degree survivable network design. STOC 2008: 759-768
2007
10EEUriel Feige, Mohit Singh: Improved Approximation Ratios for Traveling Salesperson Tours and Paths in Directed Graphs. APPROX-RANDOM 2007: 104-118
9EELap Chi Lau, Joseph Naor, Mohammad R. Salavatipour, Mohit Singh: Survivable network design with degree or order constraints. STOC 2007: 651-660
8EEMohit Singh, Lap Chi Lau: Approximating minimum bounded degree spanning trees to within one of optimal. STOC 2007: 661-670
7EEMohit Singh, Amitabha Tripathi: On an extremal problem related to a theorem of Whitney. Discrete Applied Mathematics 155(4): 579-583 (2007)
2006
6EER. Ravi, Mohit Singh: Delegate and Conquer: An LP-Based Approximation Algorithm for Minimum Degree MSTs. ICALP (1) 2006: 169-180
5EEDaniel Golovin, Viswanath Nagarajan, Mohit Singh: Approximating the k-multicut problem. SODA 2006: 621-630
2005
4EEKedar Dhamdhere, Vineet Goyal, R. Ravi, Mohit Singh: How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems. FOCS 2005: 367-378
3EEKedar Dhamdhere, R. Ravi, Mohit Singh: On Two-Stage Stochastic Minimum Spanning Trees. IPCO 2005: 321-334
2004
2EEVittorio Bilò, Vineet Goyal, R. Ravi, Mohit Singh: On the Crossing Spanning Tree Problem. APPROX-RANDOM 2004: 51-60
2003
1EEMohit Singh, Amitabha Tripathi: Order of a Graph with given Vertex and Edge Connectivity and Minimum Degree. Electronic Notes in Discrete Mathematics 15: 196-197 (2003)

Coauthor Index

1Vittorio Bilò [2]
2Kedar Dhamdhere [3] [4]
3Uriel Feige [10] [14]
4Michel X. Goemans [15]
5Daniel Golovin [5]
6Vineet Goyal [2] [4]
7Fabrizio Grandoni [13] [16]
8Anupam Gupta [13]
9Nicholas J. A. Harvey [15]
10Kamal Jain [15]
11Tamás Király [12]
12Lap Chi Lau [8] [9] [11] [12]
13Stefano Leonardi [13]
14Pauli Miettinen [13]
15Viswanath Nagarajan [5]
16Joseph Naor (Seffi Naor) [9]
17R. Ravi [2] [3] [4] [6] [16]
18Mohammad R. Salavatipour [9]
19Piotr Sankowski [13]
20Amitabha Tripathi [1] [7]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)