Institutional Repository
| a network flow approach to the minimum common integer partition problem | |
| Zhao Wenbo; Zhang Peng; Jiang Tao | |
| 2006 | |
| Source | THEORETICAL COMPUTER SCIENCE
 |
| ISSN | 0304-3975 |
| Volume | 369Issue:1-3Pages:456-462 |
| Indexed Type | sci ; sciencedirect |
| Keyword | Minimum Common Integer Partition Approximation Algorithm Network Flow |
| Department | 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. |
| Subject | Computer Science, Theory & Methods |
| Language | 英语 |
| Content Type | 期刊论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/11438 |
| Collection | 中国科学院软件研究所 |
| Recommended Citation 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. |
| Files in This Item: | ||||||
| File Name/Size | DocType | Version | Access | License | ||
| a network flow appro（178KB） | 开放获取 | -- | Application Full Text | |||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment