000 00385 a2200133 4500
035 _a
090 _c24768
_d24768
100 _aDu, D. Z
245 _aOn fast heuristic for minimum edge length rectangular partition
_cD. Z. Du
260 _aBerkeley
_bMathematical Sciences Research Institute
_c1986
300 _a39 p
_c29 cm
500 _aContine bibliografie
942 _aIMAR
_cCART
_sSN
999 _c24478
_d24478