# Re: Discussion about transformation TSP to UniqueTSP

*From*: "deepakc" <deepakc@xxxxxxxxxxxxxxxx>*Date*: 28 Nov 2006 04:30:36 -0800

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.

.

**Follow-Ups**:**Re: Discussion about transformation TSP to UniqueTSP***From:*deepakc

**References**:**Discussion about transformation TSP to UniqueTSP***From:*Radosław Hofman

**Re: Discussion about transformation TSP to UniqueTSP***From:*tchow

**Re: Discussion about transformation TSP to UniqueTSP***From:*deepakc

**Re: Discussion about transformation TSP to UniqueTSP***From:*Radoslaw Hofman

- Prev by Date:
**Re: Discussion about transformation TSP to UniqueTSP** - Next by Date:
**Re: Discussion regarding Mr. Diabys algorithm** - Previous by thread:
**Re: Discussion about transformation TSP to UniqueTSP** - Next by thread:
**Re: Discussion about transformation TSP to UniqueTSP** - Index(es):