Verified Approximation Algorithms (Q7361693)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
AFP entry Approximation_Algorithms
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Verified Approximation Algorithms |
AFP entry Approximation_Algorithms |
Statements
16 January 2020
0 references
Robin Eßmann
0 references
Tobias Nipkow
0 references
Simon Robillard
0 references
Ujkan Sulejmani
0 references
Verified Approximation Algorithms (English)
0 references
We present the first formal verification of approximation algorithms for NP-complete optimization problems: vertex cover, set cover, independent set, center selection, load balancing, and bin packing. The proofs correct incompletenesses in existing proofs and improve the approximation ratio in one case.
0 references
