2957 search results - page 72 / 592 » The Complexity of Polynomial-Time Approximation |
SDM
2007
SIAM
13 years 9 months ago
2007
SIAM
Consensus clustering has emerged as one of the principal clustering problems in the data mining community. In recent years the theoretical computer science community has generated...
HYBRID
2004
Springer
14 years 1 months ago
2004
Springer
The joint spectral radius of a set of matrices is a measure of the maximal asymptotic growth rate that can be obtained by forming long products of matrices taken from the set. This...
CALC
2001
Springer
14 years 6 days ago
2001
Springer
We show that recent results of Coppersmith, Boneh, Durfee and Howgrave-Graham actually apply in the more general setting of (partially) approximate common divisors. This leads us t...
ICALP
2001
Springer
14 years 5 days 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...
STOC
2005
ACM
14 years 8 months ago
2005
ACM
In combinatorial optimization, a popular approach to NP-hard problems is the design of approximation algorithms. These algorithms typically run in polynomial time and are guarante...