Varia.

diff --git a/macros.tex b/macros.tex
index f70ca7fe235aacea10cea0c3b40024102e9bd51f..850c162da756327b27bb23c9a062e9f89782c9af 100644 (file)
--- a/macros.tex
+++ b/macros.tex
@@ -53,6 +53,7 @@
 \def\poly{\mathop{\rm poly}}
 \def\E{{\bb E}}
 \def\crpt{\mathop{\Uparrow}}
+\def\C{{\cal C}}
 
 \def\brk{\hfil\break}
 

diff --git a/opt.tex b/opt.tex
index 32477d9785467173a89c823e79cc14c66c5fc75a..6ba150d2a9acd3fb495bb8c54742928ecefbf393 100644 (file)
--- a/opt.tex
+++ b/opt.tex
@@ -531,8 +531,6 @@ suffices to decrease~$\varepsilon$ twice.
 
 \section{Robust contractions}
 
-\def\C{{\cal C}}
-
 Having the soft heaps at hand, we would like to use them in a~conventional MST
 algorithm in place of a~usual heap. The most efficient specimen of a~heap-based
 algorithm we have seen so far is the Iterated Jarn\'\i{}k's algorithm (\ref{itjar}).
@@ -749,4 +747,11 @@ time there. The rest of the algorithm spends $\O(m)$ time on the other operation
 and $\O(n)$ on identifying the live vertices.
 \qed
 
+%--------------------------------------------------------------------------------
+
+\section{An optimal algorithm}
+
+
+
+
 \endpart