Sciweavers

642 search results - page 4 / 129
» Approximation Algorithms for Minimum K-Cut
Sort
View
99
Voted
DAM
1998
66views more  DAM 1998»
15 years 2 months ago
Approximation Algorithms for Minimum Tree Partition
Nili Guttmann-Beck, Refael Hassin
69
Voted
ESA
1997
Springer
78views Algorithms» more  ESA 1997»
15 years 6 months ago
Improved Approximations for Minimum Cardinality Quadrangulations of Finite Element Meshes
Matthias Müller-Hannemann, Karsten Weihe
90
Voted
STOC
1989
ACM
66views Algorithms» more  STOC 1989»
15 years 6 months ago
The Minimum Consistent DFA Problem Cannot Be Approximated within any Polynomial
Leonard Pitt, Manfred K. Warmuth
145
Voted
ISAAC
2000
Springer
135views Algorithms» more  ISAAC 2000»
15 years 6 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
15 years 29 days 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...