\documentclass[12pt]{article}
\usepackage{amsmath,amssymb,amsfonts}
\begin{document}
We give an $O(n)$-time algorithm for the
minimum cost flow problem over an undirected one-tree with $n$ vertices. A one-tree is a spanning tree with one additional edge.
\end{document}