We introduce a new rounding technique designed for online optimization problems, which is
related to contention resolution schemes, a technique initially introduced in the context of …

Online contention resolution schemes (OCRSs) were proposed by Feldman, Svensson, and
Zenklusen as a generic technique to round a fractional solution in the matroid polytope in an …

Consider a network design application where we wish to lay down a minimum-cost
spanning tree in a given graph; however, we only have stochastic information about the …

Background. Our results tie into the literature on contention resolution schemes [3], which we
briefly define. Let P (𝐺) denote the fractional matching polytope of a graph 𝐺=(𝑉, 𝐸). In a …

We consider the problem of maximizing the sum of a monotone submodular function and a
linear function subject to a general solvable polytope constraint. Recently, Sviridenko et …

We introduce a new rounding technique designed for online optimization problems, which is
related to contention resolution schemes, a technique initially introduced in the context of …

The stochastic matching problem deals with finding a maximum matching in a graph whose
edges are unknown but can be accessed via queries. This is a special case of stochastic k …

Motivated by an application in kidney exchange, we study the following stochastic matching
problem: We are given a graph G (V, E)(not necessarily bipartite), where each edge in E is …

Suppose we are given a submodular function f over a set of elements, and we want to
maximize its value subject to certain constraints. Good approximation algorithms are known …

A stochastic probing problem consists of a set of elements whose values are independent
random variables. The algorithm knows the distributions of these variables, but not the …