The Greedy Algorithm of the Longest Nesting of d-Dimension Boxes
最长d维箱嵌套问题的贪心算法

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.