3894 search results - page 29 / 779 » Approximation Algorithms for Biclustering Problems |
173
click to vote
ISAAC
2009
Springer
16 years 29 days 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...
152
click to vote
ATAL
2007
Springer
15 years 10 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...
152
click to vote
STOC
1994
ACM
15 years 10 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...