diff -r 7b0f43733557 -r 675024f99bf0 exzerpt.out.ps
--- a/exzerpt.out.ps	Tue Feb 22 18:58:21 2011 +0100
+++ /dev/null	Thu Jan 01 00:00:00 1970 +0000
@@ -1,147 +0,0 @@
-%!
-/pdfmark where{pop}
-{/globaldict where{pop globaldict}{userdict}ifelse/pdfmark/cleartomark load put}
-ifelse
-[
-/Title(Einleitung)
-/Count -3
-/Action/GoTo/Dest(section.1)cvn
-/OUT pdfmark
-[
-/Title(Themen:)
-/Action/GoTo/Dest(subsection.1.1)cvn
-/OUT pdfmark
-[
-/Title(Problem-/Anwendungsbereiche:)
-/Action/GoTo/Dest(subsection.1.2)cvn
-/OUT pdfmark
-[
-/Title(Literatur:)
-/Action/GoTo/Dest(subsection.1.3)cvn
-/OUT pdfmark
-[
-/Title(Divide and Conquer)
-/Count -5
-/Action/GoTo/Dest(section.2)cvn
-/OUT pdfmark
-[
-/Title(Formulierung des Divide and Conquer Prinzips)
-/Action/GoTo/Dest(subsection.2.1)cvn
-/OUT pdfmark
-[
-/Title(Quicksort)
-/Count -1
-/Action/GoTo/Dest(subsection.2.2)cvn
-/OUT pdfmark
-[
-/Title(Analyse)
-/Action/GoTo/Dest(subsubsection.2.2.1)cvn
-/OUT pdfmark
-[
-/Title(N\344chste Paare)
-/Count -2
-/Action/GoTo/Dest(subsection.2.3)cvn
-/OUT pdfmark
-[
-/Title(Algorithmus)
-/Action/GoTo/Dest(subsubsection.2.3.1)cvn
-/OUT pdfmark
-[
-/Title(Analyse)
-/Action/GoTo/Dest(subsubsection.2.3.2)cvn
-/OUT pdfmark
-[
-/Title(Segmentschnitt)
-/Count -2
-/Action/GoTo/Dest(subsection.2.4)cvn
-/OUT pdfmark
-[
-/Title(Algorithmus)
-/Action/GoTo/Dest(subsubsection.2.4.1)cvn
-/OUT pdfmark
-[
-/Title(Analyse)
-/Action/GoTo/Dest(subsubsection.2.4.2)cvn
-/OUT pdfmark
-[
-/Title(Polynomprodukt und Fast Fourier-Transformation)
-/Action/GoTo/Dest(subsection.2.5)cvn
-/OUT pdfmark
-[
-/Title(Randomisierung)
-/Count -1
-/Action/GoTo/Dest(section.3)cvn
-/OUT pdfmark
-[
-/Title(Hashing)
-/Action/GoTo/Dest(subsection.3.1)cvn
-/OUT pdfmark
-[
-/Title(Amortisierte Analyse)
-/Count -3
-/Action/GoTo/Dest(section.4)cvn
-/OUT pdfmark
-[
-/Title(Binomial Heaps)
-/Action/GoTo/Dest(subsection.4.1)cvn
-/OUT pdfmark
-[
-/Title(Fibonacci Heaps)
-/Action/GoTo/Dest(subsection.4.2)cvn
-/OUT pdfmark
-[
-/Title(Union Find)
-/Action/GoTo/Dest(subsection.4.3)cvn
-/OUT pdfmark
-[
-/Title(Greedy)
-/Count -1
-/Action/GoTo/Dest(section.5)cvn
-/OUT pdfmark
-[
-/Title(K\374rzeste \(billigste\) Wege)
-/Action/GoTo/Dest(subsection.5.1)cvn
-/OUT pdfmark
-[
-/Title(Bin Packing)
-/Count -2
-/Action/GoTo/Dest(section.6)cvn
-/OUT pdfmark
-[
-/Title(Online Verfahren)
-/Count -3
-/Action/GoTo/Dest(subsection.6.1)cvn
-/OUT pdfmark
-[
-/Title(Next Fit \(NF\))
-/Action/GoTo/Dest(subsubsection.6.1.1)cvn
-/OUT pdfmark
-[
-/Title(First-Fit \(FF\))
-/Action/GoTo/Dest(subsubsection.6.1.2)cvn
-/OUT pdfmark
-[
-/Title(Best-Fit \(BF\))
-/Action/GoTo/Dest(subsubsection.6.1.3)cvn
-/OUT pdfmark
-[
-/Title(Offline Verfahren)
-/Count -2
-/Action/GoTo/Dest(subsection.6.2)cvn
-/OUT pdfmark
-[
-/Title(First Fit Decreasing \(FFD oder FFNI\))
-/Action/GoTo/Dest(subsubsection.6.2.1)cvn
-/OUT pdfmark
-[
-/Title(Best Fit Decreasing \(BFD\))
-/Action/GoTo/Dest(subsubsection.6.2.2)cvn
-/OUT pdfmark
-[
-/Title(Dynamische Programmierung)
-/Action/GoTo/Dest(section.7)cvn
-/OUT pdfmark
-[
-/Title(Landau-Symbole)
-/Action/GoTo/Dest(appendix.A)cvn
-/OUT pdfmark