...
机译:选定内部Steiner最小树的一个更好的恒定因子逼近
School of Mathematics and Statistics, Lanzhou University, Lanzhou, Gansu 730000, P.R. China;
Department of Computer Science, University of Texas at Dallas, Richardson, TX 75080, USA;
Department of Computer Science, University of Texas at Dallas, Richardson, TX 75080, USA;
Department of Computer Science, University of Texas at Dallas, Richardson, TX 75080, USA;
Department of Computer Science, University of Texas at Dallas, Richardson, TX 75080, USA;
selected-internal steiner tree; approximation algorithm;
机译:选定内部Steiner最小树的一个更好的恒定因子逼近
机译:具有最少Steiner点数的Steiner树的逼近
机译:瓶颈选择-内部和部分终端Steiner树问题
机译:选定内部Steiner最小树的(1 +ρ)-逼近
机译:改进的最小-最大树覆盖,有界树覆盖,浅光和批量购买k-Steiner树以及(k,2)-子图近似算法
机译:节点加权Steiner树方法可识别与癌症相关的信号通路的元素
机译:选定内部Steiner最小树的一个更好的恒定因子逼近