[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: [Sheflug] Weird algorithm question



On 25/06/10 14:45, Adam Funk wrote:
I'm trying to figure out a good algorithm for some NLP work, but I don't
know what the algorithm or computational problem is called.  I'd
appreciate any pointers in the right direction.

On a quick squiz, I think you're asking us to solve the travelling salesman problem in less-than-exponential time.

If sheflug comes up trumps on this one I will be duly impressed ;)

Ta

Alex.

PS. It might be that for some reason yours is a special case in which there is a shortcut. If you think of each number as a node identifier and each relation as a vertex, though, you have a graph - which makes me think that your problem is equivalent to TTS. If there is more information you can derive from it, though, there may be wins to be had.

_______________________________________________
Sheffield Linux User's Group
http://sheflug.org.uk/mailman/listinfo/sheflug_sheflug.org.uk
FAQ at: http://www.sheflug.org.uk/mailfaq.html

GNU - The Choice of a Complete Generation