%0 Journal Article
%T The Greedy Algorithm of the Longest Nesting of d-Dimension Boxes<br>最长d维箱嵌套问题的贪心算法
%A SONG Chuan-Ming WANG Xiang-Hai
%A <br>宋传鸣
%A 王相海
%J 计算机科学
%D 2003
%I 
%X 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.
%K Greedy algorithm
%K Llongest nesting of d-dimension boxes
%K Depth degree
%K Time complexity<br>贪心算法
%K 排序方法
%K 时间复杂度
%K 最长d维箱嵌套问题
%K 计算机
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=64A12D73428C8B8DBFB978D04DFEB3C1&aid=91963E555FE5F70D&yid=D43C4A19B2EE3C0A&vid=340AC2BF8E7AB4FD&iid=59906B3B2830C2C5&sid=8575BEDA702C4B7C&eid=D5C9DC4EF2F78008&journal_id=1002-137X&journal_name=计算机科学&referenced_num=0&reference_num=5