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 incompletenesses in existing proofs and improve the approximation ratio in one case. All...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Logical methods in computer science Ročník 18, Issue 1
Hlavní autoři:	Eßmann, Robin, Nipkow, Tobias, Robillard, Simon, Sulejmani, Ujkan
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Logical Methods in Computer Science e.V 01.03.2022
Témata:	computer science - data structures and algorithms computer science - logic in computer science
ISSN:	1860-5974, 1860-5974
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Popis
Shrnutí:	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 incompletenesses in existing proofs and improve the approximation ratio in one case. All proofs are uniformly invariant based.
ISSN:	1860-5974 1860-5974
DOI:	10.46298/lmcs-18(1:36)2022