I didn't get why this problem is NP...Can you give me more details..
I think 0/1 kanpsack should work for this problem...
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this
0/1 kanpsack is NP problem ;-)
On 11/1/06, cooljunta [EMAIL PROTECTED] wrote:
I didn't get why this problem is NP...Can you give me more details..I think 0/1 kanpsack should work for this problem...
--~--~-~--~~~---~--~~
You received this message because you are
Knap sack algorithm works well when 'M' is small.
I think this a NP problem.
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com
To
Can you put some more light on the problem by giving some more examples ?
On 10/30/06, Joe [EMAIL PROTECTED] wrote:
Give an Optimal Allocation Algorithm for the described problem:Given 'n' riders of varying weight, they should be allocated to cars
and a car can be allocated 0=M weight. Algorithm
Use Knap sack algorithm i think its best for this kind of problems
search on google :)
On 10/30/06, Joe [EMAIL PROTECTED] wrote:
Give an Optimal Allocation Algorithm for the described problem:Given 'n' riders of varying weight, they should be allocated to cars
and a car can be allocated 0=M
