MadSci Network: Computer Science

Re: polynomial time solution for traveling salesman?

Date: Thu Oct 5 05:07:02 2000
Posted By: Steve Marvell, Independent Researcher
Area of science: Computer Science
ID: 963205221.Cs

It's hard to say without knowing the exact details. I have not specifically
looked into others' research in this area.

It is quite often the case that highly complex problems such as this one can
be reduced in complexity by applying an assumption. These assumptions make
the solution "impure", but when assumption like "the salesman is unlikely
to travel from one side of the planet to the other in one go" are so
"obviously" correct, that the solution is not tainted in any way.

If this is too wooly, I suggest resubmitting, detailing the algorithm.

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

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

MadSci Home | Information | Search | Random Knowledge Generator | MadSci Archives | Mad Library | MAD Labs | MAD FAQs | Ask a ? | Join Us! | Help Support MadSci

MadSci Network,
© 1995-2000. All rights reserved.