generated from sxlxc/pdflatex-note
33 lines
1.1 KiB
TeX
33 lines
1.1 KiB
TeX
\documentclass[noamssymb,aspectratio=169]{beamer}
|
|
\usetheme{moloch} % new metropolis
|
|
% fonts
|
|
\usepackage{fontspec}
|
|
\setsansfont[
|
|
ItalicFont={Fira Sans Italic},
|
|
BoldFont={Fira Sans Medium},
|
|
BoldItalicFont={Fira Sans Medium Italic}
|
|
]{Fira Sans}
|
|
\setmonofont[BoldFont={Fira Mono Medium}]{Fira Mono}
|
|
\AtBeginEnvironment{tabular}{%
|
|
\addfontfeature{Numbers={Monospaced}}
|
|
}
|
|
\usepackage{lete-sans-math}
|
|
|
|
\title{Connectivity Interdiction \& \\ Perturbed Graphic Matroid Cogirth}
|
|
\date{\today}
|
|
\author{Cong Yu}
|
|
\institute{Algorithm \& Logic Group, UESTC}
|
|
\begin{document}
|
|
\maketitle
|
|
\section{Connectivity interdiction}
|
|
\begin{frame}{Connectivity interdiction}
|
|
\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}
|
|
\end{frame}
|
|
\section{Computing cogirth in perturbed graphic matroids}
|
|
\begin{frame}{Perturbed graphic matroids}
|
|
\end{frame}
|
|
\end{document} |