机译:具有少量施坦纳顶点的施蒂纳树的参数化近似方案
Charles Univ Prague Comp Sci Inst Prague 11800 Czech Republic;
Charles Univ Prague Dept Appl Math Prague 11800 Czech Republic;
Czech Tech Univ Fac Informat Technol Prague 16000 Czech Republic;
Charles Univ Prague Dept Appl Math Prague 11800 Czech Republic|Univ Warsaw Fac Math Informat & Mech PL-02097 Warsaw Poland;
Charles Univ Prague Comp Sci Inst Prague 11800 Czech Republic;
Charles Univ Prague Comp Sci Inst Prague 11800 Czech Republic|Univ Warwick Dept Comp Sci Coventry CV4 7AL W Midlands England;
Steiner tree; Steiner forest; approximation algorithms; parameterized algorithms;
机译:具有少量Steiner顶点的Steiner树的参数化逼近方案
机译:具有少量Steiner顶点的Steiner树的参数化逼近方案
机译:将平面Steiner树的内核扩展到Steiner顶点的数量
机译:具有少量施坦纳顶点的施蒂纳树的参数化近似方案
机译:改进的最小-最大树覆盖,有界树覆盖,浅光和批量购买k-Steiner树以及(k,2)-子图近似算法
机译:节点加权Steiner树方法可识别与癌症相关的信号通路的元素
机译:将平面静脉树延伸到施泰纳顶部的内核