The densest subgraph problem in a graph (DSG), in the simplest form, is the following.
Given an undirected graph G=(V, E) find a subset S⊆ V of vertices that maximizes the ratio …

In this work, we provide faster algorithms for approximating the optimal transport distance,
eg earth mover's distance, between two discrete probability distributions $\mu,\nu\in\Delta^ n …

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 study a fundamental model of resource allocation in which a finite number of resources
must be assigned in an online manner to a heterogeneous stream of customers. The …

This paper presents a robust optimal control strategy for an energy storage system (ESS) of
a grid-connected microgrid. The robust optimal control guarantees the highest possible …

We develop a general framework for finding approximately-optimal preconditioners for
solving linear systems. Leveraging this framework we obtain improved runtimes for …

We give improved algorithms for maintaining edge-orientations of a fully-dynamic graph,
such that the maximum out-degree is bounded. On one hand, we show how to orient the …

We consider the well-studied problem of completing a rank-$ r $, $\mu $-incoherent matrix
$\mathbf {M}\in\mathbb {R}^{d\times d} $ from incomplete observations. We focus on this …

It has recently been shown that ISTA, an unaccelerated optimization method, presents
sparse updates for the $\ell_1 $-regularized undirected personalized PageRank problem …

We provide faster algorithms for approximating the optimal transport distance, eg earth
mover's distance, between two discrete probability distributions on n elements. We present …