We consider the following general scheduling problem. The input consists of n jobs, each
with an arbitrary release time, size, and monotone function specifying the cost incurred when …

The Pandora's Box problem and its extensions capture optimization problems with
stochastic input where the algorithm can obtain instantiations of input random variables at …

Two central problems in Stochastic Optimization are Min-Sum Set Cover and Pandora's Box.
In Pandora's Box, we are presented with n boxes, each containing an unknown value and …

We study the generalized min sum set cover (GMSSC) problem, wherein given a collection
of hyperedges E with arbitrary covering requirements {ke∊ Z+: e∊ E}, the goal is to find an …

We study the Minimum Latency Submodular Cover (MLSC) problem, which consists of a
metric (V, d) with source r∈ V and m monotone submodular functions f 1, f 2,…, fm: 2 V→[0 …

We consider a natural model of online preference aggregation, where sets of preferred items
R1, R2,..., Rt,..., along with a demand for kt items in each Rt, appear online. Without prior …

We consider the following single-machine scheduling problem, which is often denoted
1||∑f_j: we are given n jobs to be scheduled on a single machine, where each job j has an …

The goal for the Directed Steiner Tree problem is to find a minimum cost tree in a directed
graph G=(V, E) that connects all terminals X to a given root r. It is well known that modulo a …

Pandora's Box is a central problem in decision making under uncertainty that can model
various real life scenarios. In this problem we are given n boxes, each with a fixed opening …

We study the problem of ranking with submodular valuations. An instance of this problem
consists of a ground set [m], and a collection of n monotone sub-modular set functions f 1 …