Consider the following 2-respecting min-cut problem. Given any weighted graph G and its
spanning tree T, find the minimum cut among the cuts that contain at most two edges in T …

Abstract Deep Neural Networks and Reinforcement Learning methods have empirically
shown great promise in tackling challenging combinatorial problems. In those methods a …

We prove that any two-pass graph streaming algorithm for the st reachability problem in n-
vertex directed graphs requires near-quadratic space of n 2-o (1) bits. As a corollary, we also …

We initiate the study of matroid problems in a new oracle model called dynamic oracle. Our
algorithms in this model lead to new bounds for some classic problems, and a “unified” …

We prove a lower bound on the space complexity of two-pass semi-streaming algorithms
that approximate the maximum matching problem. The lower bound is parameterized by the …

We study how to utilize (possibly erroneous) predictions in a model for computing under
uncertainty in which an algorithm can query unknown data. Our aim is to minimize the …

We consider the general problem of learning about a matrix through vector-matrix-vector
queries. These queries provide the value of $\boldsymbol {u}^{\mathrm {T}}\boldsymbol …

A seminal work of Ahn-Guha-McGregor, PODS'12 showed that one can compute a cut
sparsifier of an unweighted undirected graph by taking a near-linear number of linear …

For a directed graph $ G $ with $ n $ vertices and a start vertex $ u_ {\sf start} $, we wish to
(approximately) sample an $ L $-step random walk over $ G $ starting from $ u_ {\sf start} …

The following question arises naturally in the study of graph streaming algorithms:" Is there
any graph problem which is" not too hard", in that it can be solved efficiently with total …