a set of objects (i from 1 to m), each has:
vi: the value of object i;
si: size of object i.
try to find a subset that can minimize the total value, subject to the condition that total size greater than or equal to B
Any known approximation algorithms for it? Thanks!