@会议记录{dinitz_et_al:LIPIcs.APPROX-RANDOM.2014.115,author={Dinitz、Michael和Kortsarz、Guy和Nutov、Zeev},title={{近似均匀权重Steiner k-Forest的改进近似算法}},booktitle={近似、随机化和组合优化.算法和技术(APPROX/RANDOM 2014)},页面={115-127},series={Leibniz国际信息学论文集(LIPIcs)},国际标准图书编号={978-3-939897-74-3},ISSN={1868-8969},年份={2014},体积={28},editor={Jansen、Klaus和Rolim、Jos和Devanur、Nikhil R.和Moore、Cristopher},publisher={Schloss Dagstuhl--Leibniz Zentrum f{\“u}r Informatik},地址={Dagstuhl,德国},URL={https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2014.115},URN={URN:nbn:de:0030-drops-46925},doi={10.4230/LIPIcs.APPROX-RANDOM.2014.115},annote={关键词:k-Steiner森林;均匀权重;最稠密k-子图;近似算法}}