Sciweavers

Share
APPROX
2015
Springer
52views Algorithms» more  APPROX 2015»
2 years 9 months ago
Minimizing Maximum Flow-time on Related Machines
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 ...
Nikhil Bansal, Bouke Cloostermans
APPROX
2015
Springer
49views Algorithms» more  APPROX 2015»
2 years 9 months ago
Dimension Expanders via Rank Condensers
An emerging theory of “linear-algebraic pseudorandomness” aims to understand the linear-algebraic analogs of fundamental Boolean pseudorandom objects where the rank of subspac...
Michael A. Forbes, Venkatesan Guruswami
APPROX
2015
Springer
62views Algorithms» more  APPROX 2015»
2 years 9 months ago
Weighted Polynomial Approximations: Limits for Learning and Pseudorandomness
Low-degree polynomial approximations to the sign function underlie pseudorandom generators for halfspaces, as well as algorithms for agnostically learning halfspaces. We study the...
Mark Bun, Thomas Steinke
APPROX
2015
Springer
47views Algorithms» more  APPROX 2015»
2 years 9 months ago
Learning Circuits with few Negations
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...
Eric Blais, Clément L. Canonne, Igor Carbon...
APPROX
2015
Springer
49views Algorithms» more  APPROX 2015»
2 years 9 months ago
On Linear Programming Relaxations for Unsplittable Flow in Trees
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...
Zachary Friggstad, Zhihan Gao
APPROX
2015
Springer
61views Algorithms» more  APPROX 2015»
2 years 9 months ago
The Container Selection Problem
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...
Viswanath Nagarajan, Kanthi K. Sarpatwar, Baruch S...
APPROX
2015
Springer
54views Algorithms» more  APPROX 2015»
2 years 9 months ago
Deterministically Factoring Sparse Polynomials into Multilinear Factors and Sums of Univariate Polynomials
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...
Ilya Volkovich
APPROX
2015
Springer
56views Algorithms» more  APPROX 2015»
2 years 9 months ago
Local Convergence of Random Graph Colorings
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...
Amin Coja-Oghlan, Charilaos Efthymiou, Nor Jaafari
APPROX
2015
Springer
57views Algorithms» more  APPROX 2015»
2 years 9 months ago
Inapproximability of H-Transversal/Packing
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...
Venkatesan Guruswami, Euiwoong Lee
APPROX
2015
Springer
51views Algorithms» more  APPROX 2015»
2 years 9 months ago
Swendsen-Wang Algorithm on the Mean-Field Potts Model
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...
Andreas Galanis, Daniel Stefankovic, Eric Vigoda
books