| 最长d维箱嵌套问题的贪心算法 |
| |
| 引用本文： | 宋传鸣 王相海. 最长d维箱嵌套问题的贪心算法[J]. 计算机科学, 2003, 30(12): 161-163 |
| |
| 作者姓名： | 宋传鸣 王相海 |
| |
| 作者单位： | 1. 辽宁师范大学计算机与信息技术学院,大连,116029
2. 南京大学计算机软件新技术国家重点实验室,南京,210093 |
| |
| 基金项目： | 南京大学计算机软件新技术国家重点实验室开放课题基金，大连市科技基金计划项目资助 |
| |
| 摘 要： | The Greedy algorithm is a simple,direct and efficient method to many problems. In this paper,the longest nesting problem of d-dimension boxes is brought up firstly. And then a novel algorithm for this problem based on greedy strategy is proposed. Finally, the time complexity of the proposed algorithm is analyzed. Simulation results show it is effective.
|
| 关 键 词： | 贪心算法 排序方法 时间复杂度 最长d维箱嵌套问题 计算机 |
The Greedy Algorithm of the Longest Nesting of d-Dimension Boxes |
| |
| SONG Chuan-Ming WANG Xiang-Hai. The Greedy Algorithm of the Longest Nesting of d-Dimension Boxes[J]. Computer Science, 2003, 30(12): 161-163 |
| |
| Authors: | SONG Chuan-Ming WANG Xiang-Hai |
| |
| Abstract: | The Greedy algorithm is a simple,direct and efficient method to many problems. In this paper,the longest nesting problem of d-dimension boxes is brought up firstly. And then a novel algorithm for this problem based on greedy strategy is proposed. Finally, the time complexity of the proposed algorithm is analyzed. Simulation results show it is effective. |
| |
| Keywords: | Greedy algorithm Llongest nesting of d-dimension boxes Depth degree Time complexity |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机科学》浏览原始摘要信息 |
|
点击此处可从《计算机科学》下载全文 |
