Fast And Simple Approximation Algorithms for Maximum Weighted Independent Set of Links (CPCI-S收录) | |
Wan, Peng-Jun[1]; Jia, Xiaohua[2]; Dai, Guojun[3]; Du, Hongwei[4]; Frieder, Ophir[5] | |
会议名称 | 2014 PROCEEDINGS IEEE INFOCOM |
URL标识 | 查看原文 |
内容类型 | 会议论文 |
URI标识 | http://www.corc.org.cn/handle/1471x/2046377 |
专题 | 华南理工大学 |
作者单位 | 1.[1]IIT, Dept Comp Sci, Chicago, IL 60616 USA 2.[2]City Univ Hong Kong, Dept Comp Sci, Hong Kong, Hong Kong, Peoples R China 3.[3]Hangzhou DianZi Univ, Sch Comp Sci, Hangzhou, Peoples R China 4.[4]HIT Shenzhen Grad Sch, Dept Comp Sci & Technol, Shenzhen, Peoples R China 5.[5]Georgetown Univ, Dept Comp Sci, Washington, DC 20057 USA |
推荐引用方式 GB/T 7714 | Wan, Peng-Jun[1],Jia, Xiaohua[2],Dai, Guojun[3],等. Fast And Simple Approximation Algorithms for Maximum Weighted Independent Set of Links (CPCI-S收录)[C]. 见:2014 PROCEEDINGS IEEE INFOCOM. |
个性服务 |
查看访问统计 |
相关权益政策 |
暂无数据 |
收藏/分享 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论