1158 search results - page 37 / 232 » Approximation Algorithms for the Fixed-Topology Phylogenetic... |
139
click to vote
ISBRA
2010
Springer
15 years 11 months ago
2010
Springer
d abstract), Nicola Ferraro, Luigi Palopoli, Simona Panni and Simona E. Rombo. Uncovering Hidden Phylogenetic Consensus d abstract), Nicholas Pattengale, Krister Swenson and Bernar...
136
click to vote
AMC
2006
15 years 4 months ago
2006
This paper considers an extension of a vehicle routing problem with backhauls (VRPB). In this problem, a set of costumers are divided in two subsets consisting of linehaul and bac...
143
Voted
STACS
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We study computationally hard combinatorial problems arising from the important engineering question of how to maximize the number of connections that can be simultaneous...
153
click to vote
NIPS
2004
15 years 5 months ago
2004
Various problems in machine learning, databases, and statistics involve pairwise distances among a set of objects. It is often desirable for these distances to satisfy the propert...
143
click to vote
CEC
2008
IEEE
15 years 11 months ago
2008
IEEE
— Recently it has been proved that the (1+1)-EA produces poor worst-case approximations for the vertex cover problem. In this paper the result is extended to the (1+λ)-EA by pro...