Mobile edge computing (MEC) is a promising technique for providing low-latency access to
services at the network edge. The services are hosted at various types of edge nodes with …

We consider the problem of maximizing a non-negative submodular set function f: 2N-> RR+
over a ground set N subject to a variety of packing type constraints including (multiple) …

We consider the problem of maximizing a nonnegative submodular set function f: 2^ N →
R^+ f: 2 N→ R+ subject to ap-matchoid constraint in the single-pass streaming setting …

We study packing LPs in an online model where the columns are presented to the algorithm
in random order. This natural problem was investigated in various recent studies motivated …

Balkanski and Singer [4] recently initiated the study of adaptivity (or parallelism) for
constrained submodular function maximization, and studied the setting of a cardinality …

In this work, we investigate the problem of joint optimization over placement and routing of
network function chains in data centers. In the offline case, we demonstrate that a classical …

We develop a continuous-time framework based on multiplicative weight updates to
approximately solve continuous optimization problems. The framework allows for a simple …

In bipartite matching problems, vertices on one side of a bipartite graph are paired with
those on the other. In its online variant, one side of the graph is available offline, while the …

The bandit problem with graph feedback, proposed in [Mannor and Shamir, NeurIPS 2011],
is modeled by a directed graph $ G=(V, E) $ where $ V $ is the collection of bandit arms, and …

Many studies show that the dedicated short range communication (DSRC) band is
insufficient to carry increasing wireless traffic demands in vehicular networks. The release of …