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 study an online weighted assignment problem with a set of fixed nodes corresponding to
advertisers and online arrival of nodes corresponding to ad impressions. Advertiser a has a …

In the unsplittable flow problem on a path, we are given a capacitated path P and n tasks,
each task having a demand, a profit, and start and end vertices. The goal is to compute a …

Motivated by several applications, we consider the problem of randomly rounding a
fractional solution in a matroid (base) polytope to an integral one. We consider the pipage …

We study the problem of unsplittable flow on a path (UFP), which arises naturally in many
applications such as bandwidth allocation, job scheduling, and caching. Here we are given …

We study the unsplittable flow on a path problem which has received a lot of attention in the
research community recently. Given is a path with capacities on its edges and a set of tasks …

In the unsplittable flow on a path problem (UFP) we are given a path with edge capacities
and a collection of tasks. Each task is characterized by a subpath, a profit, and a demand …

In the Unsplittable Flow on a Path problem (UFP) we are given a path with edge capacities,
and a set of tasks where each task is characterized by a subpath, a demand, and a weight …

In a column-restricted covering integer program (CCIP), all the non-zero entries of any
column of the constraint matrix are equal. Such programs capture capacitated versions of …

The unsplittable flow on a path (UFP) problem is a well-studied optimization problem, and it
has applications in various settings like bandwidth allocation, caching, and scheduling. We …