The full Steiner tree problem

Arora, 1998, Proof verification and the hardness of approximation problems, J. Assoc. Comput. Mach., 45, 501, 10.1145/278298.278306

Ausiello, 1999

Bern, 1989, The Steiner problem with edge lengths 1 and 2, Inform. Process. Lett., 32, 171, 10.1016/0020-0190(89)90039-2

Borchers, 1997, The k-Steiner ratio in graphs, SIAM J. Comput., 26, 857, 10.1137/S0097539795281086

Cheng, 2001

Du, 2000

Foulds, 1982, The Steiner problem in phylogeny is NP-complete, Adv. Appl. Math., 3, 43, 10.1016/S0196-8858(82)80004-3

Garey, 1977, The complexity of computing Steiner minimal trees, SIAM J. Appl. Math., 32, 835, 10.1137/0132072

Garey, 1977, The rectilinear Steiner problem is NP-complete, SIAM J. Appl. Math., 32, 826, 10.1137/0132071

Graur, 2000

Gröpl, 2001, Approximation algorithms for the Steiner tree problem in graphs, 235

Gusfield, 1997

Hwang, 1986, A linear time algorithm for full Steiner trees, Oper. Res. Lett., 4, 235, 10.1016/0167-6377(86)90008-8

Hwang, 1992, The Steiner tree problem, Vol. 53

Karp, 1972, Reducibility among combinatorial problems, 85

J. Kim, T. Warnow, Tutorial on phylogenetic tree estimation, Manuscript, Department of Ecology and Evolutionary Biology, Yale University, 1999.

Papadimitriou, 1991, Optimization, approximization and complexity classes, J. Comput. System Sci., 43, 425, 10.1016/0022-0000(91)90023-X

Rayward-Smith, 1983, The computation of nearly minimum Steiner trees in graphs, Internat. J. Math. Ed. Sci. Tech., 14, 15, 10.1080/0020739830140103

H.T. Wareham, On the computational complexity of inferring evolutionary trees, Tech. Report 93-01, Department of Computer Science, Memorial University of Newfoundland, 1993.

Waterman, 1995