dpanagea/TSP-Presentation

Presentation of the TSP (Travelling Salesman Problem), proof it is NP-complete and an introduction to approximation algorithms. This project was implemented for the undergraduate course "Advanced Topics on Algorithms".

TeX