593
click to vote
APPROX
10 years 3 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...
582
click to vote
APPROX
10 years 3 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...
573
click to vote
APPROX
10 years 3 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...
569
click to vote
APPROX
10 years 3 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...
545
click to vote
APPROX
10 years 3 months ago
2015 Springer
Given an undirected graph G = (VG, EG) and a fixed pattern graph H = (VH , EH ) with k vertices, we consider the H-Transversal and H-Packing problems. The former asks to find th...
|
Algorithms