38 citations · 157 across the 44 of their papers we have counts for
5 papers · 1 filter
When LP is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings
Nikhil Bansal, Anupam Gupta, Jian Li +3
Consider a random graph model where each possible edge is present independently with some probability . Given these probabilities, we want to build a large/heavy matching…
The Geometry of Scheduling
Nikhil Bansal, Kirk Pruhs
We consider the following general scheduling problem: The input consists of n jobs, each with an arbitrary release time, size, and a monotone function specifying the cost incurred…
On Generalizations of Network Design Problems with Degree Bounds
Nikhil Bansal, Rohit Khandekar, Jochen Konemann +2
Iterative rounding and relaxation have arguably become the method of choice in dealing with unconstrained and constrained network design problems. In this paper we extend the scope…
When LP is the Cure for Your Matching Woes: Approximating Stochastic Matchings
Nikhil Bansal, Anupam Gupta, Viswanath Nagarajan +1
This results in this paper have been merged with the result in arXiv:1002.3763v1 The authors would like to withdraw this version. Please see arXiv:1008.5356v1 for the merged versio…
Constructive Algorithms for Discrepancy Minimization
Nikhil Bansal
Given a set system (V,S), V={1,...,n} and S={S1,...,Sm}, the minimum discrepancy problem is to find a 2-coloring of V, such that each set is colored as evenly as possible. In this…