It is not vertex cover but an edge covering we are interested in. Sorry
I have been out of touch with graphs for quite some time.
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to
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
Reading about hamming distance and clustering methods might help.
bullockbefriending bard wrote:
A single 6 Pick bet looks like this:
RACE1 RACE2RACE3RACE4 RACE5 RACE6
runner1 / runner 2 / runner 3 / runner4 / runner5 / runner6 - $amount
e.g. we might have:
5 / 3 / 11 / 7
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.
bullockbefriending bard wrote:
A single
Thanks. I'm going to try to see what happens if I throw my data at
py-cluster with some kind of nearness metric based initially upon
Hamming distance - perhaps later can include bet size in this and kill
two birds with one stone. Still going to be a lot of computational work
to then group
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
