| A 2-approximation algorithm for path coloring on trees of rings | |
| Deng, Xiaotie; Li, Guojun; Zang, Wenan; Zhou, Yi | |
| 2000 | |
| 会议名称 | 11th Annual International Symposium on Algorithms and Computation, ISAAC 2000 |
| 会议日期 | 18 December 2000 through 20 December 2000 |
| 卷号 | 1969 |
| 页码 | 144-155 |
| 收录类别 | EI ; SCOPUS |
| 会议录 | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
 |
| URL标识 | 查看原文 |
| 内容类型 | 会议论文 |
| URI标识 | http://www.corc.org.cn/handle/1471x/6089510 |
| 专题 | 山东大学 |
| 作者单位 | 1.City University of Hong Kong, Hong Kong, China 2.The University of Hong Kong, Hong Kong, China 3.S |
| 推荐引用方式 GB/T 7714 | Deng, Xiaotie,Li, Guojun,Zang, Wenan,et al. A 2-approximation algorithm for path coloring on trees of rings[C]. 见:11th Annual International Symposium on Algorithms and Computation, ISAAC 2000. 18 December 2000 through 20 December 2000. |
| 个性服务 |
| 查看访问统计 |
| 相关权益政策 |
| 暂无数据 |
| 收藏/分享 |
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。
修改评论