z

main.tex

@@ -1,12 +1,7 @@
-\documentclass{beamer}
+\documentclass[noamssymb,aspectratio=169]{beamer}
 \usetheme{moloch}   % new metropolis
 % fonts
 \usepackage{fontspec}
-\setmainfont[
-    ItalicFont={Fira Sans Italic},
-    BoldFont={Fira Sans Medium},
-    BoldItalicFont={Fira Sans Medium Italic}
-]{Fira Sans}
 \setsansfont[
     ItalicFont={Fira Sans Italic},
     BoldFont={Fira Sans Medium},
@@ -16,29 +11,21 @@
 \AtBeginEnvironment{tabular}{%
     \addfontfeature{Numbers={Monospaced}}
 }
-\usepackage{firamath-otf}
+\usepackage{lete-sans-math}
 
 \title{Connectivity Interdiction \& \\ Perturbed Graphic Matroid Cogirth}
 \date{\today}
 \author{Cong Yu}
-\institute{A\&L Group, UESTC}
+\institute{Algorithm \& Logic Group, UESTC}
 \begin{document}
 \maketitle
 \section{Connectivity interdiction}
 \begin{frame}{Connectivity interdiction}
-\begin{problem}[CI]
+\begin{problem}[Zenklusen ORL'14]
+Let $G=(V,E)$ be an undirected multi-graph with edge capacity $c:E\to\mathbb{Z}_+$ and edge weights $w:E\to\mathbb{Z}_+$ and let $B\in \mathbb Z_+$ be the budget.
 
+Find an edge set $F$ with $w(F)\leq B$ s.t. the min-cut in $G-F$ is minimized.
 \end{problem}
-\begin{theorem}[aaa]
-sdfsdf
-\end{theorem}
-\begin{lemma}[aaa]
-sdfsdf
-\end{lemma}
-\begin{proof}
-	sdfs
-\end{proof}
-
 \end{frame}
 \section{Computing cogirth in perturbed graphic matroids}
 \begin{frame}{Perturbed graphic matroids}