49 search results - page 9 / 10 » focs 2004 |
FOCS
2005
IEEE
14 years 3 months ago
2005
IEEE
This paper studies the computational complexity of the following type of quadratic programs: given an arbitrary matrix whose diagonal elements are zero, find x ∈ {−1, +1}n th...
COCO
2006
Springer
14 years 1 months ago
2006
Springer
Let C be a class of distributions over {0, 1}n . A deterministic randomness extractor for C is a function E : {0, 1}n {0, 1}m such that for any X in C the distribution E(X) is sta...
CORR
2011
Springer
13 years 1 months ago
2011
Springer
We study the lift-and-project procedures of Lov´asz-Schrijver and Sherali-Adams applied to the standard linear programming relaxation of the traveling salesperson problem with tr...
FOCS
2009
IEEE
14 years 4 months ago
2009
IEEE
Polynomial time preprocessing to reduce instance size is one of the most commonly deployed heuristics to tackle computationally hard problems. In a parameterized problem, every in...
STACS
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. We consider the problem of scheduling jobs on related machines owned by selfish agents and provide the first deterministic mechanisms with constant approximation that a...