Verified Approximation Algorithms

Robin Eßmann, Tobias Nipkow, Simon Robillard

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

3 Scopus citations

Abstract

We present the first formal verification of approximation algorithms for NP-complete optimization problems: vertex cover, independent set, load balancing, and bin packing. We uncover incompletenesses in existing proofs and improve the approximation ratio in one case.

Original languageEnglish
Title of host publicationAutomated Reasoning - 10th International Joint Conference, IJCAR 2020, Proceedings
EditorsNicolas Peltier, Viorica Sofronie-Stokkermans
PublisherSpringer
Pages291-306
Number of pages16
ISBN (Print)9783030510534
DOIs
StatePublished - 2020
Event10th International Joint Conference on Automated Reasoning, IJCAR 2020 - Virtual, Online
Duration: 1 Jul 20204 Jul 2020

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume12167 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference10th International Joint Conference on Automated Reasoning, IJCAR 2020
CityVirtual, Online
Period1/07/204/07/20

Fingerprint

Dive into the research topics of 'Verified Approximation Algorithms'. Together they form a unique fingerprint.

Cite this