40 search results - page 6 / 8 » approx 2006 |
167
click to vote
APPROX
2006
Springer
15 years 10 months ago
2006
Springer
We prove that any real matrix A contains a subset of at most 4k/ + 2k log(k + 1) rows whose span "contains" a matrix of rank at most k with error only (1 + ) times the er...
154
click to vote
APPROX
2006
Springer
15 years 10 months ago
2006
Springer
Inspired by Feige (36th STOC, 2004), we initiate a study of sublinear randomized algorithms for approximating average parameters of a graph. Specifically, we consider the average ...
166
click to vote
APPROX
2006
Springer
15 years 10 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 ...
187
click to vote
APPROX
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. This paper investigates the relationship between the dimension theory of partial orders and the problem of scheduling precedenceconstrained jobs on a single machine to mi...
143
click to vote
APPROX
2007
Springer
15 years 10 months ago
2007
Springer
We study the Steiner Tree problem in the model of two-stage stochastic optimization with non-uniform inflation factors, and give a poly-logarithmic approximation factor for this pr...