I believe that your problem may be np hard ,because you may construct a polynomial reduction from maximum length path in a graph (which is NP-Complete).It is quite interesting that exists such a dichotomy between minimum vs maximum path in graph(P vs NP).Also i have an idea that you may construct a reduction from maxsat.Otherwise try to find a polynomial algorithm..:)(and please send to me ...)
--~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
