Re: Discussion about transformation TSP to UniqueTSP
- From: tchow@xxxxxxxxxxxxx
- Date: 28 Nov 2006 17:12:21 GMT
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. EXACT TSP is
DP-complete, where DP is the class of languages L that are the intersection
of a language in NP and a language in co-NP (i.e., there exists L_1 in NP
and L_2 in co-NP such that L = L_1 intersect L_2). Note that DP is *not*
the same as NP intersect co-NP. DP is also the second level of something
called the Boolean hierarchy. DP is contained in NP, of course, but it is
not known whether DP = NP.
I think that a proof that EXACT TSP is DP-complete may be found in
Papadimitriou's book "Computational Complexity" (but I don't have a copy of
it on me right now). Also you may be able to find a proof using Google, now
that you know to search for "EXACT TSP" and "DP-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
.
- Follow-Ups:
- 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
- Discussion about transformation TSP to UniqueTSP
- Prev by Date: Re: Water surface in hexahedron
- Next by Date: Re: Question on computational complexity
- Previous by thread: Re: Discussion about transformation TSP to UniqueTSP
- Next by thread: Re: Discussion about transformation TSP to UniqueTSP
- Index(es):
Relevant Pages
|