Sciweavers

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

84

Voted

DAM
1998

93views more DAM 1998»

On the Approximability of the Steiner Tree Problem in Phylogeny

15 years 2 months ago

On the Approximability of the Steiner Tree Problem in Phylogeny

Download www.cs.iastate.edu

David Fernández-Baca, Jens Lagergren

Real-time Traffic

DAM 1998 |

claim paper

Related Content

» Improved Approximation Algorithms for the Quality of Service Multicast Tree Problem

» Algorithms for Terminal Steiner Trees

» Approximate Maximum Parsimony and Ancestral Maximum Likelihood

» A PTAS for NodeWeighted Steiner Tree in Unit Disk Graphs

» Terminal Steiner Tree with Bounded Edge Length

» On the Approximability of the Steiner Tree Problem

» A Near Linear Time Approximation Scheme for Steiner Tree Among Obstacles in the Plane

» A PartitionBased Relaxation For Steiner Trees

» Lower bounds for the relative greedy algorithm for approximating Steiner trees

Post Info
More Details (n/a)

Added	22 Dec 2010
Updated	22 Dec 2010
Type	Journal
Year	1998
Where	DAM
Authors	David Fernández-Baca, Jens Lagergren

Comments (0)