Minimum k Arborescences with Bandwidth Constraints.


https://doi.org/10.1007/s00453-003-1054-1
@article{DBLP:journals/algorithmica/CaiDW04, author = {Mao{-}cheng Cai and Xiaotie Deng and Lusheng Wang}, title = {Minimum k Arborescences with Bandwidth Constraints}, journal = {Algorithmica}, volume = {38}, number = {4}, pages = {529--537}, year = {2004}, url = {https://doi.org/10.1007/s00453-003-1054-1}, doi = {10.1007/s00453-003-1054-1}, timestamp = {Fri, 27 Mar 2020 08:44:25 +0100}, biburl = {https://dblp.org/rec/journals/algorithmica/CaiDW04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }

本页面没有标签
本页面最近更新:2020/05/21更新历史
发现错误?想一起完善? 在 GitHub 上编辑此页!
本页面的全部内容在 CC BY-SA 4.0 SATA 协议之条款下提供,附加条款亦可能应用

Copyright © 2016 - 2020 PKU Scholar

最近更新: 52aade4, 2020-05-21