Hi, I read a paper which claimed that for a particular problem called the multi-node service provisioning problem, a fully polynomial time approximation algorithm cannot exists unless P=NP. Does this also imply that we cannot create any algorithm that gives a solution say within (1+\epsilon) of the optimal solution ?
Thanks, Darth --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
