7015 search results - page 173 / 1403 » Approximation algorithms for co-clustering |
CORR
2002
Springer
13 years 9 months ago
2002
Springer
In this paper we study approximation algorithms for solving a general covering integer program. An
TCS
2002
13 years 9 months ago
2002
Under the hypothesis that NP has positive p-dimension, we prove that any approximation algorithm A for MAX3SAT must satisfy at least one of the following:
WEA
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. The vertex cover problem is a classical NP-complete problem for which the best worst-case approximation ratio is 2− o(1). In this paper, we use a collection of simple g...
CAGD
2006
13 years 9 months ago
2006
We suggest a local hybrid approximation scheme based on polynomials and radial basis functions, and use it to modify the scattered data fitting algorithm of [7]. Similar to that a...
STOC
1996
ACM
14 years 1 months ago
1996
ACM
We consider the problem of scheduling n jobs that are released over time on a single machine in order to minimize the total ow time. This problem is well-known to be NPcomplete, a...