Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

53

GECCO
2006
Springer

favoriteEmaildiscussreport

128views Optimization» more GECCO 2006»

Maximum cardinality matchings on trees by randomized local search

15 years 1 months ago

Maximum cardinality matchings on trees by randomized local search

Download www.cs.bham.ac.uk

Oliver Giel, Ingo Wegener

Real-time Traffic

GECCO 2006 | Optimization |

claim paper

Related Content

» Ant System for the kCardinality Tree Problem

» Local Search for the Maximum Parsimony Problem

» Local search for stable marriage problems

» On the Relative Merits of Simple Local Search Methods for the MAXSAT Problem

» Evolutionary algorithms and matroid optimization problems

» Cache Conscious Indexing for DecisionSupport in Main Memory

» Approximate Nearest Subspace Search with Applications to Pattern Recognition

» Tracembler software for insilico chromosome walking in unassembled genomes

» Coverage of a Planar Point Set With Multiple Robots Subject to Geometric Constraints

Post Info
More Details (n/a)

Added	23 Aug 2010
Updated	23 Aug 2010
Type	Conference
Year	2006
Where	GECCO
Authors	Oliver Giel, Ingo Wegener

Comments (0)