1279 search results - page 59 / 256 » Approximation Algorithms for Min-Max Generalization Problems |
STOC
2005
ACM
14 years 9 months ago
2005
ACM
A low-distortion embedding between two metric spaces is a mapping which preserves the distances between each pair of points, up to a small factor called distortion. Low-distortion...
FSTTCS
2009
Springer
14 years 3 months ago
2009
Springer
We introduce and study the donation center location problem, which has an additional application in network testing and may also be of independent interest as a general graph-theor...
JMLR
2010
13 years 3 months ago
2010
It is probably fair to say that exact inference in graphical models is considered a solved problem, at least regarding its computational complexity: it is exponential in the treew...
APPROX
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. We consider the problem of fitting an n × n distance matrix M by a tree metric T. We give a factor O(min{n1/p , (k log n)1/p }) approximation algorithm for finding the...
FOCS
2006
IEEE
14 years 2 months ago
2006
IEEE
We extend the binary search technique to searching in trees. We consider two models of queries: questions about vertices and questions about edges. We present a general approach t...