Re: Discussion about transformation TSP to UniqueTSP
- From: tchow@xxxxxxxxxxxxx
- Date: 28 Nov 2006 18:32:45 GMT
In article <456c6df5$0$568$b45e6eb0@xxxxxxxxxxxxxxxxxxxxxxxxx>, I wrote:
In article <1164714136.832964.38370@xxxxxxxxxxxxxxxxxxxxxxxxxxxx>,
deepakc <deepakc@xxxxxxxxxxxxxxxx> wrote:
Could U pls advise whether this Question for the TSP is also
NP-Complete: -
"Does there exist a TSP tour of length = C ??"
This problem is usually called the EXACT TSP problem.
Gerhard Woeginger pointed out to me by email that I goofed here. EXACT
TSP is the question of whether the *optimal* tour has length = C. I also
incorrectly said:
DP is contained in NP, of course
I meant to say that NP is contained in DP. Showing that DP is contained
in NP would, among other things, show that NP = co-NP.
Getting back to your question, it is certainly in NP, and I think it is
NP-complete, but I don't see immediately how to prove that.
--
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
.
- 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: tchow
- Discussion about transformation TSP to UniqueTSP
- Prev by Date: Re: Discussion about transformation TSP to UniqueTSP
- Next by Date: Re: Discussion about transformation TSP to UniqueTSP
- Previous by thread: Re: Discussion about transformation TSP to UniqueTSP
- Next by thread: Re: Discussion about transformation TSP to UniqueTSP
- Index(es):
Relevant Pages
|