First Page | Document Content | |
---|---|---|
![]() Date: 2009-01-01 08:42:54Computational complexity theory Graph theory Mathematics Phylogenetics NP-complete problems Computational phylogenetics Analysis of algorithms Probabilistic complexity theory Randomized algorithm Steiner tree problem Algorithm Maximum parsimony | Add to Reading List |
![]() | Research Article Climbing the Steiner Tree—Sources of Active Information in a Genetic Algorithm for Solving the Euclidean Steiner Tree Problem Winston Ewert,1* William Dembski,2 Robert J. Marks II1DocID: 1tff1 - View Document |
![]() | comput. complex), 281 – 040281–27 DOIs00037c Birkh¨DocID: 1rc9S - View Document |
![]() | A Constant-Factor Approximation for Stochastic Steiner Forest ∗ Anupam Gupta Amit KumarDocID: 1r7hn - View Document |
![]() | LNCSFixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree ReconstructionDocID: 1qRse - View Document |
![]() | A Constant-Factor Approximation Algorithm for the Multicommodity Rent-or-Buy Problem Amit Kumar ∗ Anupam Gupta†DocID: 1qObK - View Document |