In the dynamic linear program (LP) problem, we are given an LP undergoing updates and
we need to maintain an approximately optimal solution. Recently, significant attention (eg …

We present a simple semi-streaming algorithm for (1—ɛ)-approximation of bipartite
matching in O (log (n)/ɛ) passes. This matches the performance of state-of-the-art “ɛ …

We resolve the space complexity of single-pass streaming algorithms for approximating the
classic set cover problem. For finding an α-approximate set cover (for α= o (√ n)) via a …

Graph neural networks (GNNs) have emerged as a powerful tool for solving combinatorial
optimization problems (COPs), exhibiting state-of-the-art performance in both graph …

We give new upper and lower bounds for the dynamic set cover problem. First, we give a (1+
є) f-approximation for fully dynamic set cover in O (f 2log n/є5)(amortized) update time, for …

Abstract Recently, Rubinstein, Schramm, and Weinberg [ITCS'18] gave an algorithm for
finding an exact global minimum cut of undirected graphs in the cut-query model in which …

We study the Set Cover problem in the one-pass edge-arrival streaming model. In this
model, the input stream consists of a sequence of tuples (S, u), indicating that element u is …

We study the maximum k-coverage problem in the general edge-arrival streaming model:
given a collection of m sets F, each subset of a ground set of elements U of size n, the task is …

We study linear programming and general LP-type problems in several big data (streaming
and distributed) models. We mainly focus on low dimensional problems in which the number …

We design a Local Computation Algorithm (LCA) for the set cover problem. Given a set
system where each set has size at most s and each element is contained in at most t sets …