论文信息 - NP-hard networking problems: exact and approximate algorithms - 字舞流文

NP-hard networking problems: exact and approximate algorithms

Rouven Naujoks | Rouven Naujoks

[1] Kaizhong Zhang,et al. Perfect Phylogenetic Networks with Recombination , 2001, J. Comput. Biol..

[2] David M. Warme,et al. Exact Algorithms for Plane Steiner Tree Problems: A Computational Study , 2000 .

[3] Martin Zachariasen. Rectilinear full Steiner tree generation , 1999 .