Re: Discussion about transformation TSP to UniqueTSP

Radoslaw Hofman wrote:
Hi,

Does it make any difference? We can transform every NP problem to HC
and then build TSP with question PATH==N, that means that every NP
problem can be transformed to version having == in question.

In mine opinion <= is used to show that we are asking for optimal tour
instead of tour of size N, but it does not matter for me.

Cheers,
Radek Hofman

Hmmm, yes u're right !!
somehow it escaped me.

.

Relevant Pages