Assertion: recursive algorithm | /r/CapableOf | add item
Facets:
value: as long as there is
type: OTHER
Source sentences:
text: The heuristic algorithm for this problem is called the Greedy Approximation Algorithm which sorts the items based on their value per unit mass and adds the items with the highest v/m as long as there is still space remaining.