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...

Full description

Saved in:

Bibliographic Details
Published in:	Logical methods in computer science Vol. 18, Issue 1
Main Authors:	Eßmann, Robin, Nipkow, Tobias, Robillard, Simon, Sulejmani, Ujkan
Format:	Journal Article
Language:	English
Published:	Logical Methods in Computer Science e.V 01.03.2022
Subjects:	computer science - data structures and algorithms computer science - logic in computer science
ISSN:	1860-5974, 1860-5974
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	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