On the approximability of the Steiner tree problem in phylogeny
type: Item
instance of: scholarly article
title: On the approximability of the Steiner tree problem in phylogeny
zbMATH Open document ID: 0927.68060
DOI: 10.1016/S0166-218X(98)00069-9
author: Jens Lagergren
author: David Fernández-Baca
published in: Discrete Applied Mathematics
publication date: 1998-01-01T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68U99
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 1268158
zbMATH Keywords: Steiner tree problem
MaRDI profile type: Publication
cites work: Q4230322
cites work: Improved Approximations for the Steiner Tree Problem
cites work: Two strikes against perfect phylogeny
cites work: Q4234114
cites work: The computational complexity of inferring rooted phylogenies by parsimony
cites work: Convex tree realizations of partitions
cites work: An idealized concept of the true cladistic character
cites work: Q4818875
cites work: The Steiner problem in phylogeny is NP-complete
cites work: The Steiner tree problem
cites work: Aligning sequences via an evolutionary tree: complexity and approximation
cites work: Approximation algorithms for combinatorial problems
cites work: Q3221403
cites work: Optimization, approximation, and complexity classes
cites work: The complexity of reconstructing trees from qualitative characters and subtrees
cites work: Q4875201
description: scientific article; zbMATH DE number 1268158