Re: Discussion about transformation TSP to UniqueTSP

In article <1164715189.322820.305970@xxxxxxxxxxxxxxxxxxxxxxxxxxx>,
Radoslaw Hofman <radekh@xxxxxxxxx> wrote:
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.

Ah, yes, good! (I'm just getting caught up here.) This indeed shows that
Chermakhani's problem is NP-complete.
--
Tim Chow tchow-at-alum-dot-mit-dot-edu
The range of our projectiles---even ... the artillery---however great, will
never exceed four of those miles of which as many thousand separate us from
the center of the earth. ---Galileo, Dialogues Concerning Two New Sciences
.

Relevant Pages