1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.DS2009
Region growing for multi-route cuts
Siddharth Barman, Shuchi Chawla
We study a number of multi-route cut problems: given a graph G=(V,E) and connectivity thresholds k_(u,v) on pairs of nodes, the goal is to find a minimum cost set of edges or verti…
cs.GT2009
Pricing Randomized Allocations
Patrick Briest, Shuchi Chawla, Robert Kleinberg +1
Randomized mechanisms, which map a set of bids to a probability distribution over outcomes rather than a single outcome, are an important but ill-understood area of computational m…