In this paper, we study max-weight stochastic matchings on online bipartite graphs under
both vertex and edge arrivals. We focus on designing polynomial time approximation …

Motivated by recent progress on stochastic matching with few queries, we embark on a
systematic study of the sparsification of stochastic packing problems (SPP) more generally …

Virtual Reality (VR) has emerged due to advancements in hardware and computer graphics.
During the pandemic, conferences and exhibitions leveraging VR have gained attention …

In this paper, we study the weighted stochastic matching problem. Let $ G=(V, E) $ be a
given edge-weighted graph and let its realization $\mathcal {G} $ be a random subgraph of …

We study the minimum vertex cover problem in the following stochastic setting. Let G be an
arbitrary given graph, p∊(0, 1] a parameter of the problem, and let Gp be a random …

In the stochastic weighted matching problem, the goal is to find a large-weight matching of a
graph when we are uncertain about the existence of its edges. In particular, each edge e has …

We study the stochastic vertex cover problem. In this problem, G=(V, E) is an arbitrary known
graph, and G⋆ is an unknown random subgraph of G where each edge e is realized …

We study the robust-à la Chakrabarti, Cormode, and McGregor [STOC'08]-communication
complexity of the maximum bipartite matching problem. The edges of an adversarially …

In this paper, we generalize the recently studied stochastic matching problem to more
accurately model a significant medical process, kidney exchange, and several other …

We study a stochastic variant of monotone submodular maximization problem as follows. We
are given a monotone submodular function as an objective function and a feasible domain …