TY - GEN
T1 - Verified Approximation Algorithms
AU - Eßmann, Robin
AU - Nipkow, Tobias
AU - Robillard, Simon
N1 - Publisher Copyright:
© 2020, Springer Nature Switzerland AG.
PY - 2020
Y1 - 2020
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=85088260755&partnerID=8YFLogxK
U2 - 10.1007/978-3-030-51054-1_17
DO - 10.1007/978-3-030-51054-1_17
M3 - Conference contribution
AN - SCOPUS:85088260755
SN - 9783030510534
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 291
EP - 306
BT - Automated Reasoning - 10th International Joint Conference, IJCAR 2020, Proceedings
A2 - Peltier, Nicolas
A2 - Sofronie-Stokkermans, Viorica
PB - Springer
T2 - 10th International Joint Conference on Automated Reasoning, IJCAR 2020
Y2 - 1 July 2020 through 4 July 2020
ER -