formal/afp/Approximation_Algorithms/document/root.tex

\documentclass[11pt,a4paper]{article}
\usepackage[T1]{fontenc}
\usepackage{isabelle,isabellesym}

% this should be the last package used
\usepackage{pdfsetup}

% urls in roman style, theory text in math-similar italics
\urlstyle{rm}
\isabellestyle{it}


\begin{document}

\title{Verified Approximation Algorithms}
\author{Robin E{\ss}mann, Tobias Nipkow, Simon Robillard, Ujkan Sulejmani}
\maketitle

\begin{abstract}
We present the first formal verifications of approximation algorithms
for NP-complete optimization problems:
vertex cover, set cover, independent set, center selection, load balancing, and bin packing.
The proofs correct incompletnesses in existing proofs
and improve the approximation ratio in one case.
A detailed description of our work (excluding center selection) has been published in the proceedings of
\emph{IJCAR 2020} \cite{EssmannNR-IJCAR20}.
\end{abstract}

\tableofcontents

% include generated text of all theories
\input{session}

\bibliographystyle{abbrv}
\bibliography{root}

\end{document}