3875 search results - page 94 / 775 » Approximation algorithms for the 0-extension problem |
233
click to vote
SDM
2012
SIAM
13 years 6 months ago
2012
SIAM
Given the ubiquity of time series data, the data mining community has spent significant time investigating the best time series similarity measure to use for various tasks and dom...
135
click to vote
FOCS
2006
IEEE
15 years 10 months ago
2006
IEEE
We consider approximation algorithms for non-uniform buy-at-bulk network design problems. The first nontrivial approximation algorithm for this problem is due to Charikar and Kar...
141
click to vote
LATIN
2004
Springer
15 years 9 months ago
2004
Springer
We consider the problem of protein folding in the HP model on the 3D square lattice. This problem is combinatorially equivalent to folding a string of 0’s and 1’s so that the s...
122
click to vote
FSTTCS
2001
Springer
15 years 9 months ago
2001
Springer
Semidefinite programming based approximation algorithms, such as the Goemans and Williamson approximation algorithm for the MAX CUT problem, are usually shown to have certain perf...
119
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We consider the problem of finding a lowest cost dominating set in a given disk graph containing n disks. The problem has been extensively studied on subclasses of disk graphs, ye...