740 search results - page 5 / 148 » An approximation ratio for biclustering |
RANDOM
2001
Springer
13 years 12 months ago
2001
Springer
We discuss two approximation approaches, the primal-dual schema and the local-ratio technique. We present two relatively simple frameworks, one for each approach, which extend know...
WADS
2005
Springer
14 years 27 days ago
2005
Springer
We analyze the performance of simple algorithms for matching two planar point sets under rigid transformations so as to minimize the directed Hausdorff distance between the sets....
ESA
2005
Springer
14 years 28 days ago
2005
Springer
We present two polynomial-time approximation algorithms for the metric case of the maximum traveling salesman problem. One of them is for directed graphs and its approximation rat...
MA
2011
Springer
13 years 2 months ago
2011
Springer
The ratio of the largest eigenvalue divided by the trace of a p×p random Wishart matrix with n degrees of freedom and identity covariance matrix plays an important role in variou...
SODA
2000
ACM
13 years 8 months ago
2000
ACM
The Steiner tree problem in weighted graphs seeks a minimum weight connected subgraph containing a given subset of the vertices terminals. We present a new polynomial-time heurist...