1 paper
Robin Eßmann, Tobias Nipkow, Simon Robillard +1
We present the first formal verification of approximation algorithms for NP-complete optimization problems: vertex cover, independent set, set cover, center selection, load balanci…