Greedy algorithm - Invite guests to a party

Asked Apr 14 '15 at 07:30

Active Apr 14 '15 at 07:33

Viewed 1,635 times

Giving the problem in the link below,

Is it possible to find an algorithm using graphs with less than O(n^3)?

edited May 23 '17 at 12:22

Community

asked Apr 14 '15 at 07:30

orohev

Reading, the answer to the question in link, the answer seems to be no. Providing proof would be probably very hard though. – Neithrik Apr 15 '15 at 09:08

0 Answers0