Efficient Approximation Algorithms for Computing k-Disjoint Minimum Cost Paths with Delay Constraint | |
Guo, Longkun; Shen, Hong | |
2012 | |
关键词 | k-disjoint restricted shortest path problem LP rounding bifactor approximation algorithm NP-hard |
页码 | 627-631 |
会议录 | 2012 13TH INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED COMPUTING, APPLICATIONS, AND TECHNOLOGIES (PDCAT 2012)
![]() |
URL标识 | 查看原文 |
内容类型 | 会议论文 |
URI标识 | http://www.corc.org.cn/handle/1471x/2904698 |
专题 | 福州大学 |
推荐引用方式 GB/T 7714 | Guo, Longkun,Shen, Hong. Efficient Approximation Algorithms for Computing k-Disjoint Minimum Cost Paths with Delay Constraint[C]. 见:. |
个性服务 |
查看访问统计 |
相关权益政策 |
暂无数据 |
收藏/分享 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论