10 search results - page 1 / 2 » Maximum cardinality matchings on trees by randomized local s... |
GECCO
2006
Springer
13 years 8 months ago
2006
Springer
GECCO
2004
Springer
13 years 10 months ago
2004
Springer
This paper gives an algorithm for finding the minimum weight tree having k edges in an edge weighted graph. The algorithm combines a search and optimization technique based on phe...
ICNC
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. Four local search algorithms are investigated for the phylogenetic tree reconstruction problem under the Maximum Parsimony criterion. A new subtree swapping neighborhood ...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
The stable marriage (SM) problem has a wide variety of practical applications, ranging from matching resident doctors to hospitals, to matching students to schools, or more genera...
SAT
2010
Springer
13 years 3 months ago
2010
Springer
Algorithms based on local search are popular for solving many optimization problems including the maximum satisfiability problem (MAXSAT). With regard to MAXSAT, the state of the ...