It is true that the problem is NP-complete,albeit as DHyanesh said you can solve it via dynamic programming,the complexity of the algorithm is O(nW)(it is pseudopolynomial,because the W is proportional to the input represantation,which is unfortunately exponential). But you can find an approximation algorithm ,which can be proved quite fast and efficient..Check in google for a tutorial,there is quite a lot and pretty good material that will be proven very useful.
--~--~---------~--~----~------------~-------~--~----~ 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 unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
