Reference no: EM133653879
Question: Implement two or more approximation algorithms for the travelling salesman problem and see what sorts of inputs they perform best on as well as how close to optimal they get in practice.
Requirements
Some general guidelines for what should be included in the paper are included here, but some exceptions can be made depending on the exact topic chosen. This should be treated as just a general guideline and not an exact set of requirements. Your target audience for your paper should be your peers in the graduate program.
An explanation of the problem you chose and why.
A brief description of the algorithms you selected. If the algorithms aren't covered in class you should consider including some well formatted pseudocode as well.
For this if you tell me which algorithms you are using then I will whether we have to put pseudocode or not.
A description of your experimental procedure and what steps you took to prevent things like garbage collection and other running processes from corrupting your results.
Details about what experiments you performed and why you chose them. It is worth mentioning here that your program should take several seconds to run on the largest inputs. Anything less than that is generally too small to provide meaningful results.
Properly labelled graphs showing your results.
Well formatted citations using either ACM or IEEE.
For the final project submission, you must submit a 10 page paper which describes the topic you chose, the algorithms that you implemented, what steps you took to compare them, and your results.
You have to run different types of interesting inputs and output should be in graphs by comparing different inputs and also with optimal solution.
In report you should include output of project like graphs and any other to compare and analyze on different sorts of inputs and please include code for optimal solution and compare as per the question.