Hello,how to solve NP- completeness problems like travelling salesman problem,finding the minimum set in the given numbers.i need some explanation of how do i guess the solution of that problem??thank u
↧
Channel:
CodeChef Discuss - latest questions
X
Are you the publisher?
Claim or
contact us
about this channel.
X
0
Channel Details:
- Title: CodeChef Discuss - latest questions
- Channel Number: 13217065
- Language: English
- Registered On: May 14, 2013, 9:42 pm
- Number of Articles: 39796
- Latest Snapshot: March 26, 2019, 3:12 am
- RSS URL: http://discuss.ww2.codechef.com/feeds/rss
- Publisher: https://discuss.codechef.com/feeds/rss?
- Description: Ask and answer questions.
- Catalog: //codechef13.rssing.com/catalog.php?indx=13217065
© 2025 //www.rssing.com