True statement about the traveling salesman problem (TSP) is:

1

TSP can be solved in polynomial time.

2

TSP is an NP-complete problem.

3

TSP is a co-NP problem.

4

TSP is a P problem.

Sponsored

hivanix.in

This quiz is brought to you by hivanix.in

🌐 Web App Development

Other Tools: chatwiz.hivanix.in mmspace.hivanix.in unogame.hivanix.in

Quick Navigation

Home

Subjects

Chapters