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

Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …

Network Design is an active research area in the intersection of Combinatorial Optimization
and Theoretical Computer Science that focuses on problems arising in the realm of modern …

We consider requests for capacity in a given tree network T=(V, E) where each edge e of the
tree has some integer capacity u e. Each request f is a node pair with an integer demand df …

In this paper we consider the job interval selection problem (JISP), a simple scheduling
model with a rich history and numerous applications. Special cases of this problem include …

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 present approximation algorithms for the unsplittable flow problem (UFP) in undirected
graphs. As is standard in this line of research, we assume that the maximum demand is at …

We study the Unsplittable Flow Problem (UFP) on line graphs and cycles, focusing on the
long-standing open question of whether the problem is APX-hard. We describe a …

We introduce a novel pricing and resource allocation approach for batch jobs on cloud
systems. In our economic model, users submit jobs with a value function that specifies …

We consider the following rectangle packing problem: Given a set of rectangles, each of
which is associated with a profit, we are requested to pack a subset of the rectangles into a …