Exploring Approximation Algorithms and Their Empirical Analysis 1st Edition by Roger Doss,PHD ISBN B01N9NPVRO

Discusses various approximation algorithms for NP Complete problems and includes their source code and empirical analysis.

Approximation Algorithms are algorithms that trade accuracy for performance and are used to produce real-world solutions for NP-Complete problems. NP Complete problems are problems that are currently believed to have a worst-case running time that
is exponential, and therefore intractable.

Example problems discussed are 3SAT, Vertex Cover, and Partition. The text is organized with chapter 1, which
is a general introduction of the problem. Chapter 2, which surveys existing literature. Chapter 3, which discusses
the methodology used to provide Approximation Algorithms for the aforementioned NP-Complete problems.
Chapter 4 which presents findings and empirical analysis. And Chapter 5 which features a conclusion and future directions.

The appendices feature full source code of the Approximation Algorithms presented as well as data to reproduce
the studies.