In a long latex doc I have I get my algorithm inserted into my definition for some reason. I apologize for not having a small working example I could not get one to work. Have a bunch of overfull and underfull errors can that actually cause a problem? And what would be the easiest way to fix such? See here:
\begin{algorithm}
\caption{Primal-dual}
\begin{algorithmic}
\STATE $ c \leftarrow w.$
\STATE $S = \{u \in V : w(u) = 0 \}$.
\WHILE{$S$ is not a hitting set for $C$}
\STATE $\mathcal{M} $ a collection of cycles returned by a violation oracle Violation$(G, C, S)$.
\STATE $c_{ \mathcal{M} (u) } \leftarrow |{M _ M : u _ M}|, \forall u \in V $.
\STATE $ \alpha
\leftarrow min_ {u \in V \backslash S} | w(u)| /
c_{\mathcal{M} (u) } $
$\bar{
w(u) } \leftarrow w(u) - \alpha cM (u),$ for all u in V.
$ S \leftarrow \{u _ V : w(u) = 0 \}. $
\ENDWHILE
%end
return a minimal hitting set $ H \subset S $ of $\mathcal{C}$.
\end{algorithmic}
\end{algorithm}
\begin{definition}
For $p \geq 3$ a $p$-pocket for a planar graph G(V; E) and a cycle collection $\mathcal{C}$, is a set U $\subset$ V such that: \\
1. The set U contains at most $p$ nodes with neighbors outside U. (we call these contact nodes) \\
2. The induced subgraph $G_S [U]$ has at least p faces in $\mathcal{C}$.
\end{definition}
\newpage
before your definition or you can redefine the algorithm environment. – gvgramazio May 1 '18 at 10:53H
to the algorithm environment. – gvgramazio May 1 '18 at 11:20