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 …

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 …

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 …

A covering integer program (CIP) is a mathematical program of the form min {c⊤ x 0X2223 A
x≥ 1, 0≤ x≤ u, x∈ ℤ n}, where all entries in A, c, u are nonnegative. In the online setting …

We consider online algorithms for the generalized caching problem. Here we are given a
cache of size k and pages with arbitrary sizes and fetching costs. Given a request sequence …

We consider online algorithms for the generalized caching problem. Here we are given a
cache of size k and pages with arbitrary sizes and fetching costs. Given a request sequence …

In the weighted flow-time problem on a single machine, we are given a set of n jobs, where
each job has a processing requirement p_j, release date r_j, and weight w_j. The goal is to …

We give a randomized polynomial time algorithm with approximation ratio O (log φ (n)) for
weighted set multi-cover instances with a shallow cell complexity of at most f (n, k)= n φ (n) k …

We study a covering problem motivated by spatial models in crowdsourcing markets, where
tasks are ordered according to some geographic or temporal criterion. Assuming that each …

We introduce a method for proving Sum-of-Squares (SoS)/Lasserre hierarchy lower bounds
when the initial problem formulation exhibits a high degree of symmetry. Our main technical …