5595 search results - page 365 / 1119 » Approximation Algorithms for Clustering Problems |
182
click to vote
SIAMCOMP
2000
15 years 6 months ago
2000
There are several results available in the literature dealing with efficient construction of t-spanners for a given set S of n points in Rd. t-spanners are Euclidean graphs in whic...
156
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
In an implicit combinatorial optimization problem, the constraints are not enumerated explicitly but rather stated implicitly through equations, other constraints or auxiliary alg...
174
click to vote
ANTSW
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. For solving combinatorial optimisation problems, exact methods accurately exploit the structure of the problem but are tractable only up to a certain size; approximation ...
171
click to vote
CPM
2009
Springer
16 years 1 months ago
2009
Springer
A classical measure of similarity between strings is the length of the longest common subsequence(LCS) between the two given strings. The search for efficient algorithms for findi...
213
click to vote
CBMS
2005
IEEE
16 years 12 days ago
2005
IEEE
In this work we introduce the new problem of finding time series discords. Time series discords are subsequences of longer time series that are maximally different to all the rest...