APPROX
2005
Springer
14 years 5 months ago
2005
Springer
We consider the problem of finding a maximum independent set in a random graph. The random graph G, which contains n vertices, is modelled as follows. Every edge is included inde...
APPROX
2005
Springer
14 years 5 months ago
2005
Springer
APPROX
2005
Springer
14 years 5 months ago
2005
Springer
We study the partial vertex cover problem. Given a graph G = (V, E), a weight function w : V → R+ , and an integer s, our goal is to cover all but s edges, by picking a set of v...
APPROX
2005
Springer
14 years 5 months ago
2005
Springer
APPROX
2005
Springer
14 years 5 months ago
2005
Springer
A q-ary error-correcting code C ⊆ {1, 2, . . . , q}n is said to be list decodable to radius ρ with list size L if every Hamming ball of radius ρ contains at most L codewords o...
APPROX
2005
Springer
14 years 5 months ago
2005
Springer
APPROX
2005
Springer
14 years 5 months ago
2005
Springer
APPROX
2005
Springer
14 years 5 months ago
2005
Springer
We study the approximability of 1-in-kSAT, the variant of Max kSAT where a clause is deemed satisfied when precisely one of its literals is satisfied. We also investigate differ...
APPROX
2005
Springer
14 years 5 months ago
2005
Springer
A large class of stochastic optimization problems can be modeled as minimizing an objective function f that depends on a choice of a vector x ∈ X, as well as on a random external...
APPROX
2005
Springer
14 years 5 months ago
2005
Springer
We consider the quantum database search problem, where we are given a function f : [N] → {0, 1}, and are required to return an x ∈ [N] (a