Work

Verified Approximation Algorithms

Year: 2022

Type: article

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

Source: Logical Methods in Computer Science

DOI: 10.46298/lmcs-18(1:36)2022

Authors: Robin Eßmann, Tobias Nipkow, Simon Robillard, Ujkan Sulejmani

Institutions: Technical University of Munich, Centre National de la Recherche Scientifique, Université de Montpellier, Laboratoire d'Informatique, de Robotique et de Microélectronique de Montpellier, IMT Atlantique

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: diamond

Funder: Deutsche Forschungsgemeinschaft

Award: G653283282