Sciweavers

642 search results - page 4 / 129
» Approximation Algorithms for Minimum K-Cut
Sort
View
DAM
1998
66views more  DAM 1998»
14 years 9 months ago
Approximation Algorithms for Minimum Tree Partition
Nili Guttmann-Beck, Refael Hassin
ISAAC
2000
Springer
135views Algorithms» more  ISAAC 2000»
15 years 1 months ago
On Approximating Minimum Vertex Cover for Graphs with Perfect Matching
It has been a challenging open problem whether there is a polynomial time approximation algorithm for the Vertex Cover problem whose approximation ratio is bounded by a constant l...
Jianer Chen, Iyad A. Kanj
RECOMB
2010
Springer
14 years 8 months ago
An Approximation Algorithm for Computing a Parsimonious First Speciation in the Gene Duplication Model
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 ...
Aïda Ouangraoua, Krister M. Swenson, Cedric C...