Next, we will study algorithms for NP-hard problems whose solutions are guaranteed to be within some approximation factor of the best possible solutions. Such algorithms are often quite efficient and ...

Approximation algorithms for the TSP endeavour to provide efficient, near‐optimal solutions where exact methods prove computationally prohibitive. Seminal approaches, ...

Students must have completed Algorithms and Computation (MA407) or have taken an equivalent course to provide a basic knowledge in analysis of algorithms: running time and correctness of an algorithm, ...