1158 search results - page 23 / 232 » Approximation Algorithms for the Fixed-Topology Phylogenetic... |
TAMC
2009
Springer
15 years 5 months ago
2009
Springer
In classical network flow theory the choice of paths, on which flow is sent, is only restricted by arc capacities. This, however, is not realistic in most applications. Many prob...
105
click to vote
ISAAC
2000
Springer
15 years 2 months ago
2000
Springer
Given a set of jobs, each consisting of a number of weighted intervals on the real line, and a number m of machines, we study the problem of selecting a maximum weight subset of th...
100
click to vote
JAL
2006
14 years 11 months ago
2006
: We consider a variety of vehicle routing problems. The input to a problem consists of a graph G = (N, E) and edge lengths l(e) e E. Customers located at the vertices have to be ...
100
click to vote
CORR
2011
Springer
14 years 2 months ago
2011
Springer
A hitting set for a collection of sets is a set that has a nonempty intersection with each set in the collection; the hitting set problem is to find a hitting set of minimum card...
RECOMB
2010
Springer
14 years 9 months ago
2010
Springer
We consider the following problem: given a forest of gene family trees on a set of genomes, find a first speciation which splits these genomes into two subsets and minimizes the ...