477
Voted
APPROX
2015
Springer
9 years 11 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...
472
Voted
APPROX
2015
Springer
9 years 11 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...
371
click to vote
APPROX
2015
Springer
9 years 11 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...
370
Voted
APPROX
2015
Springer
9 years 11 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...
359
Voted
APPROX
2015
Springer
9 years 11 months ago
2015
Springer
We study the q-state ferromagnetic Potts model on the n-vertex complete graph known as the mean-field (Curie-Weiss) model. We analyze the Swendsen-Wang algorithm which is a Marko...