In graph theoretical terms the problem is to find a minimal (or a reasonably sized) vertex cover of a graph using complete multipartite graphs.
bullockbefriending bard wrote: > Any pointers much appreciated - I simply don't have the background or > experience to be able to visualise what this might be. I take it as a > given that the problem is NP-hard at the very least and that there is > no alternative but to go at it with some kind of greedy heuristic - and > any way of minimising the time it takes is going to help a lot. > > On Dec 2, 3:45 am, "Quintopia" <[EMAIL PROTECTED]> wrote: > > I think this one might have some optimal substructure, though it's not > > exactly clear what that may be. I'll give it some thought. > > > > On Dec 1, 6:26 am, "smartdude" <[EMAIL PROTECTED]> wrote: > > > > > Reading about hamming distance and clustering methods might help. --~--~---------~--~----~------------~-------~--~----~ 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-beta.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
