Treffer: VERIFIED APPROXIMATION ALGORITHMS.

We present the first formal verification of approximation algorithms for NP-complete optimization problems: vertex cover, independent set, set cover, center selection, load balancing, and bin packing. We uncover incompleteness's in existing proofs and improve the approximation ratio in one case. All proofs are uniformly invariant based. [ABSTRACT FROM AUTHOR]

Copyright of Logical Methods in Computer Science (LMCS) is the property of Logical Methods in Computer Science and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)