Csirik, J.

heuristic problem result number strip rectangle algorithm solution value value height section solution csirik pairing heuristic width analysis distribution item sizes nfd heuristic type -2 item type -2 renewal n items university type -3 items variable type -3 item nf heuristic type-l uniform distribution pairing type-l item theory theorem renewal theory function coppersmith probability raghavan method ratio 1 / i type-l items process definition list l probability theory right hand side n +2 n limit theorem right renewal theorem yields yield performance binpacking problem i n f binpacking vector version subject 11. sequence unassigned item identity wiley computer science siam j 2-2 height h error technique yields introduction width 1 frenk constraint november i bins uniform size r lemma 3.2