11 citations · 23 across the 8 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2013
Matching with our Eyes Closed
Gagan Goel, Pushkar Tripathi
Motivated by an application in kidney exchange, we study the following query-commit problem: we are given the set of vertices of a non-bipartite graph G. The set of edges in this g…
cs.DS2012
Matching with Commitments
Kevin Costello, Prasad Tetali, Pushkar Tripathi
We consider the following stochastic optimization problem first introduced by Chen et al. in \cite{chen}. We are given a vertex set of a random graph where each possible edge is pr…
cs.DS2010★ 1 cited
A Deterministic Algorithm for the Vertex Connectivity Survivable Network Design Problem
Pushkar Tripathi
In the vertex connectivity survivable network design problem we are given an undirected graph G = (V,E) and connectivity requirement r(u,v) for each pair of vertices u,v. We are al…