227 search results - page 1 / 46 » Approximation of the Quadratic Set Covering problem |
DISOPT
2007
13 years 11 months ago
2007
COR
2006
13 years 11 months ago
2006
Several approximation algorithms with proven performance guarantees have been proposed to find approximate solutions to classical combinatorial optimization problems. However, the...
ICIP
2002
IEEE
15 years 18 days ago
2002
IEEE
The approximation of surfaces to scattered data is an important problem encountered in a variety of scientific applications, such as reverse engineering, computer vision, computer...
SIAMCOMP
1998
13 years 10 months ago
1998
We build on the classical greedy sequential set cover algorithm, in the spirit of the primal-dual schema, to obtain simple parallel approximation algorithms for the set cover probl...
ICALP
2001
Springer
14 years 3 months ago
2001
Springer
We study the generalization of covering problems to partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard cov...