any approximation algorithms for this minimization problem?

[grasssu]

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!

[Vermette]

Are negative values legal?

[HeavenAgain]

well, what is the range of m?

and.... there is a greedy way to do it, complexity is O(nlogn) i think. where you sort it first, then start packing it