3894 search results - page 29 / 779 » Approximation Algorithms for Biclustering Problems |
STOC
1991
ACM
15 years 3 months ago
1991
ACM
SODA
1998
ACM
15 years 1 months ago
1998
ACM
111
click to vote
ISAAC
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. Given two comparative maps, that is two sequences of markers each representing a genome, the Maximal Strip Recovery problem (MSR) asks to extract a largest sequence of ma...
ATAL
2007
Springer
15 years 3 months ago
2007
Springer
This paper addresses distributed task allocation in complex scenarios modeled using the distributed constraint optimization problem (DCOP) formalism. We propose and evaluate a nov...
STOC
1994
ACM
15 years 3 months ago
1994
ACM
Givenn points in the Euclideanplane,we considerthe problemof findingthe minimumtree spanninganyk points.The problemis NP-hardand we givean O(logk)-approximationalgorithm. Key Words...