APPROX

2015

Springer

8 years 5 months ago
2015

Springer

We consider the online problem of minimizing the maximum ﬂow-time on related machines. This is a natural generalization of the extensively studied makespan minimization problem ...

APPROX

2015

Springer

8 years 5 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...

APPROX

2015

Springer

8 years 5 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...

APPROX

2015

Springer

8 years 5 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...

APPROX

2015

Springer

8 years 5 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...

APPROX

2015

Springer

8 years 5 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...

APPROX

2015

Springer

8 years 5 months ago
2015

Springer

We present the ﬁrst eﬃcient deterministic algorithm for factoring sparse polynomials that split into multilinear factors and sums of univariate polynomials. Our result makes p...

APPROX

2015

Springer

8 years 5 months ago
2015

Springer

Let G = G(n, m) be a random graph whose average degree d = 2m/n is below the k-colorability threshold. If we sample a k-coloring σ of G uniformly at random, what can we say about...

APPROX

2015

Springer

8 years 5 months ago
2015

Springer

Given an undirected graph G = (VG, EG) and a ﬁxed pattern graph H = (VH , EH ) with k vertices, we consider the H-Transversal and H-Packing problems. The former asks to ﬁnd th...

APPROX

2015

Springer

8 years 5 months ago
2015

Springer

We study the q-state ferromagnetic Potts model on the n-vertex complete graph known as the mean-ﬁeld (Curie-Weiss) model. We analyze the Swendsen-Wang algorithm which is a Marko...