From: Lawrence Paulson <lp15@cam.ac.uk>
Another day, another AFP entry. Eßmann, Nipkow and Robillard present the first formal verification of approximation algorithms for NP-complete optimization problems: vertex cover, independent set, load balancing, and bin packing. The proofs correct incompletenesses in existing proofs and improve the approximation ratio in one case.
You will find it online at
https://www.isa-afp.org/entries/Approximation_Algorithms.html
Keep them coming!
Larry Paulson
Last updated: Nov 21 2024 at 12:39 UTC