1158 search results - page 14 / 232 » Approximation Algorithms for the Fixed-Topology Phylogenetic... |
ATAL
2007
Springer
13 years 11 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...
SODA
2012
ACM
11 years 9 months ago
2012
ACM
We resolve the problem of small-space approximate selection in random-order streams. Specifically, we present an algorithm that reads the n elements of a set in random order and ...
COCOA
2008
Springer
13 years 9 months ago
2008
Springer
This paper deals with approximation algorithms for the prize collecting generalized Steiner forest problem, defined as follows. The input is an undirected graph G = (V, E), a colle...
BMCBI
2008
13 years 7 months ago
2008
Background: The increasing availability of fungal genome sequences provides large numbers of proteins for evolutionary and phylogenetic analyses. However the heterogeneity of data...
APPROX
2010
Springer
13 years 9 months ago
2010
Springer
We consider two natural generalizations of the Asymmetric Traveling Salesman problem: the k-Stroll and the k-Tour problems. The input to the k-Stroll problem is a directed n-verte...