Abstract：This paper discusses how to pack a set of boxes with square bottom s into a box B with a fix edsize square bott m and unbounded height such that the height of the pack in g is minimized . It is requiredth at all boxes be packed in to Borthogonally and oriented in a ll three dimension s. The problem is k no w nto b e N P-h a rd. Li a nd C h eng d ev elop ed an ap pr ox im a tio n a lg o rith m C1in 19 90 , of which the worst caseper form an ceratio is r (C1 ) = 2. 6 875 ( reference [ 1 ] ) . Based on th e id ea of algorith m C1 and the characteristics of squares, a new packing method D is developed , of which the worst-case performanceratio is r ( D ) ≤ 2*251/7 84= 2. 3 20 15.