1161 search results - page 50 / 233 » Approximation schemes for clustering problems |
HIS
2003
14 years 11 months ago
2003
Ant-based clustering and sorting is a nature-inspired heuristic for general clustering tasks. It has been applied variously, from problems arising in commerce, to circuit design, t...
ECCC
2008
14 years 9 months ago
2008
We construct public-key cryptosystems that are secure assuming the worst-case hardness of approximating the minimum distance on n-dimensional lattices to within small poly(n) fact...
BIRD
2007
Springer
15 years 3 months ago
2007
Springer
Comparison of 3-dimensional protein folds is a core problem in molecular biology. The Contact Map Overlap (CMO) scheme provides one of the most common measures for protein structur...
106
click to vote
SIAMCOMP
2008
14 years 9 months ago
2008
We consider the rooted orienteering problem: Given a set P of n points in the plane, a starting point r P, and a length constraint B, one needs to find a path starting from r tha...
154
click to vote
SIAMCOMP
2011
14 years 15 days ago
2011
We consider the Minimum Linear Arrangement problem and the (Uniform) Sparsest Cut problem. So far, these two notorious NP-hard graph problems have resisted all attempts to prove in...