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 …

We prove strong NP-completeness for the four variants of caching with multi-size pages.
These four variants are obtained by choosing either the fault cost or the bit cost model, and …

We consider the unsplittable flow problem (UFP) and the closely related column-restricted
packing integer programs (CPIPs). In UFP we are given an edge-capacitated graph G=(V, E) …

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 consider a scheduling problem where n jobs have to be carried out by m parallel
identical machines. The attributes of a job j are a fixed start time sj, a fixed finish time fj, a …

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 …

We consider the minimal cost server configuration for meeting resource demands over
multiple time slots. Specifically, there are some heterogeneous servers. Each server is …

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 …

We study a resource allocation problem where jobs have the following characteristic: each
job consumes some quantity of a bounded resource during a certain time interval and …

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 …