395
Voted
APPROX
2015
Springer
9 years 11 months ago
2015
Springer
We consider the online problem of minimizing the maximum flow-time on related machines. This is a natural generalization of the extensively studied makespan minimization problem ...
372
Voted
APPROX
2015
Springer
9 years 11 months ago
2015
Springer
An emerging theory of “linear-algebraic pseudorandomness” aims to understand the linear-algebraic analogs of fundamental Boolean pseudorandom objects where the rank of subspac...
432
Voted
APPROX
2015
Springer
9 years 11 months ago
2015
Springer
Low-degree polynomial approximations to the sign function underlie pseudorandom generators for halfspaces, as well as algorithms for agnostically learning halfspaces. We study the...
369
Voted
APPROX
2015
Springer
9 years 11 months ago
2015
Springer
Monotone Boolean functions, and the monotone Boolean circuits that compute them, have been intensively studied in complexity theory. In this paper we study the structure of Boolea...
402
Voted
APPROX
2015
Springer
9 years 11 months ago
2015
Springer
We study some linear programming relaxations for the Unsplittable Flow problem on trees (UFPtree). Inspired by results obtained by Chekuri, Ene, and Korula for Unsplittable Flow o...