Content deleted Content added
Erel Segal (talk | contribs) |
Erel Segal (talk | contribs) |
||
Line 48:
<math>OPT(K') \leq k</math> - since it is possible to pack each item in <math>K'</math> into a single bin. </blockquote>Therefore, <math>OPT(J) \leq OPT(K)+k</math>; given a solution to <math>K</math> with <math>b_K</math> bins, we can get a solution to <math>J</math> with at most <math>b_K+k</math> bins.
=== Geometric
TODO
=== Alternative geometric
TODO
| |||