3894 search results - page 72 / 779 » Approximation Algorithms for Biclustering Problems |
156
click to vote
AAIM
2008
Springer
16 years 16 days ago
2008
Springer
This paper deals with the maximum triangle packing problem. For this problem, Hassin and Rubinstein gave a randomized polynomial-time approximation algorithm that achieves an expe...
151
click to vote
ISAAC
2004
Springer
15 years 11 months ago
2004
Springer
String comparison is a fundamental problem in computer science, with applications in areas such as computational biology, text processing or compression. In this paper we address t...
149
click to vote
INFOCOM
2009
IEEE
16 years 24 days ago
2009
IEEE
—Broadcasting is a fundamental operation in wireless networks and plays an important role in the communication protocol design. In multihop wireless networks, however, interferen...
141
click to vote
IPL
2006
15 years 6 months ago
2006
We study the NP-hard problem of labeling points with maximum-radius circle pairs: given n point sites in the plane, find a placement for 2n interior-disjoint uniform circles, such...
171
click to vote
IEICET
2010
15 years 3 months ago
2010
This paper deals with the maximum-weight 2-path packing problem (M2PP), which is the problem of computing a set of vertex-disjoint paths of length 2 in a given edge-weighted compl...