| Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree | |
| Li, Wenjun; Cao, Yixin; Chen, Jianer; Wang, Jianxin* | |
| 刊名 | Information and Computation
 |
| 2017 | |
| 卷号 | 252页码:187-200 |
| 关键词 | Maximum internal spanning tree Parameterized computation Local search |
| ISSN号 | 0890-5401 |
| DOI | 10.1016/j.ic.2016.11.003 |
| 会议名称 | 25th Conference on Concurrency Theory (CONCUR) held jointly with the 9th International Symposium on Trustworthy Global Computing (TGC) / 8th International IFIP Conference on Theoretical Computer Science (IFIP-TCS) |
| URL标识 | 查看原文 |
| 会议地点 | Rome, ITALY |
| 会议日期 | SEP 02-05, 2014 |
| WOS记录号 | WOS:000390569000011;EI:20165103158230 |
| 内容类型 | 期刊论文 |
| URI标识 | http://www.corc.org.cn/handle/1471x/3320534 |
| 专题 | 中南大学 |
| 作者单位 | 1.[Li, Wenjun 2.Wang, Jianxin] Cent S Univ, Sch Informat Sci & Engn, Changsha, Hunan, Peoples R China. |
| 推荐引用方式 GB/T 7714 | Li, Wenjun,Cao, Yixin,Chen, Jianer,et al. Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree[J]. Information and Computation,2017,252:187-200. |
| APA | Li, Wenjun,Cao, Yixin,Chen, Jianer,&Wang, Jianxin*.(2017).Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree.Information and Computation,252,187-200. |
| MLA | Li, Wenjun,et al."Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree".Information and Computation 252(2017):187-200. |
| 个性服务 |
| 查看访问统计 |
| 相关权益政策 |
| 暂无数据 |
| 收藏/分享 |
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。
修改评论