# Party planning problem

Recently, I came across this problem in my textbook. Any hints on how to solve this using dynamic programming?

"Professor Stewart is consulting for the president of a corporation that is planning a company party. The company has a hierarchical structure; that is, the supervisor relation forms a tree rooted at the president. The personnel office has ranked each employee with a conviviality rating, which is a real number. In order to make the party fun for all attendees, the president does not want both an employee and his or her immediate supervisor to attend. Professor Stewart is given the tree that describes the structure of the corporation, using the left-child, right-sibling representation. Each node of the tree holds, in addition to the pointers, the name of an employee and that employee’s conviviality ranking. Describe an algorithm to make up a guest list that maximizes the sum of the conviviality ratings of the guests."

-
This question may be more suitable on stackoverflow.com. – kennytm Sep 28 '10 at 6:34
This is not in anyway programming related. – Sahni Sep 28 '10 at 8:39
Or you can try to ask this at theoretical computer science SE – Graviton Sep 28 '10 at 11:18
Given that you ask "Any hints on how to solve this using dynamic programming?", how can this not be programming-related? – Isaac Sep 28 '10 at 12:27
According to en.wikipedia.org/wiki/Dynamic_programming dynamic programming is not a subset of computer programming. – Rasmus Sep 29 '10 at 15:10