432
click to vote
APPROX
9 years 8 months ago
2015 Springer 
We present the first efficient deterministic algorithm for factoring sparse polynomials that split into multilinear factors and sums of univariate polynomials. Our result makes p...
429
click to vote
APPROX
9 years 8 months ago
2015 Springer
We introduce and study a network resource management problem that is a special case of nonmetric k-median, naturally arising in cross platform scheduling and cloud computing. In t...
387
click to vote
APPROX
9 years 8 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...
364
click to vote
APPROX
9 years 8 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...
347
click to vote
APPROX
9 years 8 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 ...
|
Algorithms