polynomial time solution for traveling salesman?

Subject: polynomial time solution for traveling salesman?

Date: Mon Jul 10 01:00:21 2000
Posted by kurt feneberger
Grade level: School: No school entered.
City: norcross State/Province: georgia Country: usa
Area of science: Computer Science
ID: 963205221.Cs

Message:


it's my understanding that the generic traveling salesman requires O(n!)
time for a brute force solution. i've found a polynomial time solution for
certain 'real-world' problem sub-sets. is this a well-known thing? i
haven't seen any reference to it in the literature (ACM, IEEE etc).

Re: polynomial time solution for traveling salesman?

Current Queue | Current Queue for Computer Science | Computer Science archives

Try the links in the MadSci Library for more information on Computer Science.