We consider the\sf Unconstrained Submodular Maximization problem in which we are given
a nonnegative submodular function f:2^N→R^+, and the objective is to find a subset S⊆N …

We consider the problem of maximizing a (non-monotone) submodular function subject to a
cardinality constraint. In addition to capturing well-known combinatorial optimization …

In this manuscript, we offer a gentle review of submodularity and supermodularity and their
properties. We offer a plethora of submodular definitions; a full description of a number of …

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 allocating indivisible goods fairly among n agents who have
additive and submodular valuations for the goods. Our fairness guarantees are in terms of …

With the proliferation of wearable cameras, the number of videos of users documenting their
personal lives using such devices is rapidly increasing. Since such videos may span hours …

Constrained submodular maximization problems have long been studied, most recently in
the context of auctions and computational advertising, with near-optimal results known …

Thanks to the increasing number and massive coverage, delivery drones, equipped with
various sensors, have demonstrated significant but unexplored potentials for large-scale …

Randomization is a fundamental tool used in many theoretical and practical areas of
computer science. We study here the role of randomization in the area of submodular …

Submodular function maximization is a central problem in combinatorial optimization,
generalizing many important NP-hard problems including max cut in digraphs, graphs, and …