176
click to vote
APPROX
15 years 5 months ago
2006 Springer 
For a given graph with weighted vertices, the goal of the minimum-weight dominating set problem is to compute a vertex subset of smallest weight such that each vertex of the graph...
125
click to vote
APPROX
15 years 5 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...
110
click to vote
APPROX
15 years 5 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...
135
click to vote
APPROX
15 years 5 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...
|
Algorithms