Re: Discussion about transformation TSP to UniqueTSP


U¿ytkownik "Rados³aw Hofman" <radekh@xxxxxxxxx> napisa³ w wiadomo¶ci
news:ekeke3$3t7$1@xxxxxxxxxxxxxxxxxxxxxxxxxx
I have proposed N^2 bites shift (adding "extra space"), while there was
discussion "can it be less". In mine opinion minimal shift needs
N^log(N) -

I meant N*log(N) bites :)

From each city we have N outgoing arcs - so we need log(N) bites to have
distinct signature for each, and because they have to be separated then each
city will have separate log(N) bites, so N*log(N).

Weigth is then multipied by 2^(N*log(N))

Best regards,

Radek Hofman


.