carmelo wrote: > imagine to have a k-ary tree, each node is a room and each edge is a > corridor; each room has a value assigned, you must place cameras in > rooms but if a room has an adiacent room with the camera you can't > place the camera inside...you must place the cameras to have the max > value possibile.. how to choose the rooms?
By 'max value possible' do you mean: The highest possible value of combined/summed 'rooms with camera' values? OR The maximum number of placable cameras? The approach is different in each case. --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
