Verified Approximation Algorithms

Robin Eßmann, Tobias Nipkow and Simon Robillard

16 January 2020


We present the first formal verification of approximation algorithms for NP-complete optimization problems: vertex cover, set cover, independent set, load balancing, and bin packing. The proofs correct incompletenesses in existing proofs and improve the approximation ratio in one case. A detailed description of our work has been published in the proceedings of IJCAR 2020.
BSD License