APPROX
2006
Springer
13 years 11 months ago
2006
Springer
APPROX
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. The Kaczmarz method for solving linear systems of equations Ax = b is an iterative algorithm that has found many applications ranging from computer tomography to digital ...
APPROX
2006
Springer
13 years 11 months ago
2006
Springer
APPROX
2006
Springer
13 years 11 months ago
2006
Springer
Consider the following problem: For given graphs G and F1, . . . , Fk, find a coloring of the edges of G with k colors such that G does not contain Fi in color i. For example, if e...
APPROX
2006
Springer
13 years 11 months ago
2006
Springer
A central problem in the algorithmic study of lattices is the closest vector problem: given a lattice v represented by some basis, and a target point y, nd the lattice point close...
APPROX
2006
Springer
13 years 11 months ago
2006
Springer
APPROX
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Combinatorial property testing deals with the following relaxation of decision problems: Given a fixed property and an input x, one wants to decide whether x satisfies th...
APPROX
2006
Springer
13 years 11 months ago
2006
Springer
We present a simple randomized construction of size O
APPROX
2006
Springer
13 years 11 months ago
2006
Springer
APPROX
2006
Springer
13 years 11 months ago
2006
Springer
