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žené v:

Podrobná bibliografia
Vydané v:	Logical methods in computer science Ročník 18, Issue 1
Hlavní autori:	Eßmann, Robin, Nipkow, Tobias, Robillard, Simon, Sulejmani, Ujkan
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Logical Methods in Computer Science e.V 01.03.2022
Predmet:	computer science - data structures and algorithms computer science - logic in computer science
ISSN:	1860-5974, 1860-5974
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

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