3894 search results - page 42 / 779 » Approximation Algorithms for Biclustering Problems |
107
click to vote
IPL
2006
15 years 2 months ago
2006
We present an NC approximation algorithm for the weighted matching problem in graphs with an approximation ratio of (1 - ). This improves the previously best approximation ratio of...
105
click to vote
IPL
2007
15 years 2 months ago
2007
The disk dimension of a planar graph G is the least number k for which G embeds in the plane minus k open disks, with every vertex on the boundary of some disk. Useful properties ...
114
Voted
STOC
2005
ACM
16 years 2 months ago
2005
ACM
77
Voted
STOC
2002
ACM
16 years 2 months ago
2002
ACM
114
Voted
STOC
2006
ACM
16 years 2 months ago
2006
ACM
Many approximation algorithms have been presented in the last decades for hard search problems. The focus of this paper is on cryptographic applications, where it is desired to de...