1158 search results - page 24 / 232 » Approximation Algorithms for the Fixed-Topology Phylogenetic... |
GD
2008
Springer
15 years 3 days ago
2008
Springer
A nonplanar graph G is near-planar if it contains an edge e such that G − e is planar. The problem of determining the crossing number of a near-planar graph is exhibited from di...
106
click to vote
APPROX
2007
Springer
15 years 5 months ago
2007
Springer
We investigate the problem of computing a minimum set of solutions that approximates within a specified accuracy the Pareto curve of a multiobjective optimization problem. We show...
83
Voted
COCOON
2006
Springer
15 years 2 months ago
2006
Springer
In a recent article, Nakhleh, Ringe and Warnow introduced perfect phylogenetic networks--a model of language evolution where languages do not evolve via clean speciation--and form...
111
click to vote
IPCO
1998
15 years 12 days ago
1998
Abstract. A well studied and difficult class of scheduling problems concerns parallel machines and precedence constraints. In order to model more realistic situations, we consider ...
ISAAC
2005
Springer
15 years 4 months ago
2005
Springer
In this paper we study the k-means clustering problem. It is well-known that the general version of this problem is NP-hard. Numerous approximation algorithms have been proposed fo...