Abstract
Combinatorial optimization problems are the subject of extensive study due to their numerous practical applications. Among the methods used to address such problems, approximation algorithms are one of the primary tools, owing to their speed compared to other approaches. This project explores the key techniques of this paradigm, focusing on two classic problems that have a substantial bod…