S = {top view};

for i = l to k do begin

select that view v not in S such that B(v, S)

is maximized;

S = S union {v};

end;

resulting S is the greedy selection;