| Efficient 2-Approximation Algorithms for Computing 2-Connected Steiner Minimal Networks | |
| Shen, Hong; Guo, Longkun | |
| 刊名 | IEEE TRANSACTIONS ON COMPUTERS
 |
| 2012 | |
| 卷号 | 61页码:954-968 |
| 关键词 | Euler walk 2-vertex (edge) connected Steiner minimal network terminal spanning-tree Survivable network design approximation algorithm shortest disjoint path pair |
| ISSN号 | 0018-9340 |
| URL标识 | 查看原文 |
| 内容类型 | 期刊论文 |
| URI标识 | http://www.corc.org.cn/handle/1471x/2903565 |
| 专题 | 福州大学 |
| 推荐引用方式 GB/T 7714 | Shen, Hong,Guo, Longkun. Efficient 2-Approximation Algorithms for Computing 2-Connected Steiner Minimal Networks[J]. IEEE TRANSACTIONS ON COMPUTERS,2012,61:954-968. |
| APA | Shen, Hong,&Guo, Longkun.(2012).Efficient 2-Approximation Algorithms for Computing 2-Connected Steiner Minimal Networks.IEEE TRANSACTIONS ON COMPUTERS,61,954-968. |
| MLA | Shen, Hong,et al."Efficient 2-Approximation Algorithms for Computing 2-Connected Steiner Minimal Networks".IEEE TRANSACTIONS ON COMPUTERS 61(2012):954-968. |
| 个性服务 |
| 查看访问统计 |
| 相关权益政策 |
| 暂无数据 |
| 收藏/分享 |
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。
修改评论