| a network flow approach to the minimum common integer partition problem | |
| Zhao Wenbo; Zhang Peng; Jiang Tao | |
| 2006 | |
| 发表期刊 | THEORETICAL COMPUTER SCIENCE
 |
| ISSN | 0304-3975 |
| 卷号 | 369期号:1-3页码:456-462 |
| 收录类别 | sci ; sciencedirect |
| 关键词 | Minimum Common Integer Partition Approximation Algorithm Network Flow |
| 部门归属 | Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China. Graad Univ, Chinese Acad Sci, Beijing, Peoples R China. Univ Calif Riverside, Dept Comp Sci & Engn, Riverside, CA 92521 USA. |
| 学科领域 | Computer Science, Theory & Methods |
| 语种 | 英语 |
| 内容类型 | 期刊论文 |
| URI标识 | http://ir.iscas.ac.cn/handle/311060/11436 |
| 专题 | 中国科学院软件研究所 |
| 推荐引用方式 GB/T 7714 | Zhao Wenbo,Zhang Peng,Jiang Tao. a network flow approach to the minimum common integer partition problem[J]. THEORETICAL COMPUTER SCIENCE,2006,369(1-3):456-462. |
| APA | Zhao Wenbo,Zhang Peng,&Jiang Tao.(2006).a network flow approach to the minimum common integer partition problem.THEORETICAL COMPUTER SCIENCE,369(1-3),456-462. |
| MLA | Zhao Wenbo,et al."a network flow approach to the minimum common integer partition problem".THEORETICAL COMPUTER SCIENCE 369.1-3(2006):456-462. |
| 条目包含的文件 | ||||||
| 文件名称/大小 | 文献类型 | 版本类型 | 开放类型 | 使用许可 | ||
| a network flow appro（178KB） | 开放获取 | -- | 请求全文 | |||
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。
修改评论