463 citations · 1k across the 47 of their papers we have counts for
Showing 2010 · cs.DSShow all
2 papers · 2 filters
cs.DS2010
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…
cs.DS2010★ 5 cited
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…