An important goal of modern scheduling systems is to efficiently manage power usage. In
energy-efficient scheduling, the operating system controls the speed at which a machine is …

The minimum-weight set cover problem is widely known to be O (log n)-approximable, with
no improvement possible in the general case. We take the approach of exploiting problem …

Fixed-parameter tractability analysis and scheduling are two core domains of combinatorial
optimization which led to deep understanding of many important algorithmic questions …

We study approximation algorithms for problems of scheduling precedence constrained jobs
with the objective of minimizing total weighted completion time, in identical and related …

We study several geometric set cover and set packing problems involving configurations of
points and geometric objects in Euclidean space. We show that it is APX-hard to compute a …

We are given a set of weighted unit disks and a set of points in Euclidean plane. The
minimum weight unit disk cover (WUDC) problem asks for a subset of disks of minimum total …

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 …

Weighted geometric set-cover problems arise naturally in several geometric and
nongeometric settings (eg, the breakthrough of Bansal and Pruhs Proceedings of FOCS …

We study scheduling problems on a machine with varying speed. Assuming a known speed
function we ask for a cost-efficient scheduling solution. Our main result is a polynomial-time …

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 …