Iterative Jarnik's alg. is correctly spelled Iterated.

diff --git a/opt.tex b/opt.tex
index bf30371d6fc71f2c75059b7369f056f78e8bad3d..c03ca52a66399b37278126746cfaef48973fc81e 100644 (file)
--- a/opt.tex
+++ b/opt.tex
@@ -666,7 +666,7 @@ trick with expanding the vertex~$c$ to~$P$ in the cycle~$C$. Hence $g\not\in\mst
 \qed
 
 \para
-We still intend to mimic the Iterative Jarn\'\i{}k's algorithm. We will partition the given graph to a~collection~$\C$
+We still intend to mimic the Iterated Jarn\'\i{}k's algorithm. We will partition the given graph to a~collection~$\C$
 of non-overlapping contractible subgraphs called \df{clusters} and we put aside all edges that got corrupted in the process.
 We recursively compute the MSF of those subgraphs and of the contracted graph. Then we take the
 union of these MSF's and add the corrupted edges. According to the previous lemma, this does not produce