Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
22
click to vote
DAM
1998
favorite
Email
discuss
report
93
views
more
DAM 1998
»
On the Approximability of the Steiner Tree Problem in Phylogeny
13 years 10 months ago
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
more »
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)
Researcher Info
DAM 2010 Study Group
Computer Vision