| Home |
| About |
| Submission |
| Updating Entries |
| Using Entries |
| Search |
| Statistics |
| Index |
| Download |
Verified Approximation Algorithms
| Title: | Verified Approximation Algorithms |
| Authors: | Robin Eßmann (robin /dot/ essmann /at/ tum /dot/ de), Tobias Nipkow and Simon Robillard |
| Submission date: | 2020-01-16 |
| Abstract: | We 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. |
| BibTeX: |
@article{Approximation_Algorithms-AFP,
author = {Robin Eßmann and Tobias Nipkow and Simon Robillard},
title = {Verified Approximation Algorithms},
journal = {Archive of Formal Proofs},
month = jan,
year = 2020,
note = {\url{http://isa-afp.org/entries/Approximation_Algorithms.html},
Formal proof development},
ISSN = {2150-914x},
}
|
| License: | BSD License |
| Status: [ok] | This is a development version of this entry. It might change over time and is not stable. Please refer to release versions for citations. |
|
Proof outline Proof document |
| Browse theories |
| Download this entry |