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) …

The study of combinatorial problems with a submodular objective function has attracted
much attention in recent years, and is partly motivated by the importance of such problems to …

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 …

We study a general stochastic probing problem defined on a universe V, where each
element e∈ V is “active” independently with probability pe. Elements have weights {we: e∈ …

Consider a random graph model where each possible edge e is present independently with
some probability pe. Given these probabilities, we want to build a large/heavy matching in …

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

Submodular maximization generalizes many fundamental problems in discrete optimization,
including Max-Cut in directed/undirected graphs, maximum coverage, maximum facility …

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 …