A new approximation algorithm for the unbalanced Min s-t Cut problem | |
Zhang, Peng | |
刊名 | THEORETICAL COMPUTER SCIENCE |
2016 | |
卷号 | 609页码:658-665 |
关键词 | Unbalanced cut MM s-t cut Approximation algorithm Linear programming Network community |
DOI | 10.1016/j.tcs.2015.02.040 |
会议名称 | 20th International Conference on Computing and Combinatorics (COCOON) |
URL标识 | 查看原文 |
会议日期 | AUG 04-06, 2014 |
内容类型 | 期刊论文 |
URI标识 | http://www.corc.org.cn/handle/1471x/4760374 |
专题 | 山东大学 |
作者单位 | Shandong Univ, Sch Comp Sci & Technol, Jinan, Peoples R China. |
推荐引用方式 GB/T 7714 | Zhang, Peng. A new approximation algorithm for the unbalanced Min s-t Cut problem[J]. THEORETICAL COMPUTER SCIENCE,2016,609:658-665. |
APA | Zhang, Peng.(2016).A new approximation algorithm for the unbalanced Min s-t Cut problem.THEORETICAL COMPUTER SCIENCE,609,658-665. |
MLA | Zhang, Peng."A new approximation algorithm for the unbalanced Min s-t Cut problem".THEORETICAL COMPUTER SCIENCE 609(2016):658-665. |
个性服务 |
查看访问统计 |
相关权益政策 |
暂无数据 |
收藏/分享 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论