1.1 --- a/exzerpt.out.ps Tue Feb 22 19:02:39 2011 +0100
1.2 +++ /dev/null Thu Jan 01 00:00:00 1970 +0000
1.3 @@ -1,147 +0,0 @@
1.4 -%!
1.5 -/pdfmark where{pop}
1.6 -{/globaldict where{pop globaldict}{userdict}ifelse/pdfmark/cleartomark load put}
1.7 -ifelse
1.8 -[
1.9 -/Title(Einleitung)
1.10 -/Count -3
1.11 -/Action/GoTo/Dest(section.1)cvn
1.12 -/OUT pdfmark
1.13 -[
1.14 -/Title(Themen:)
1.15 -/Action/GoTo/Dest(subsection.1.1)cvn
1.16 -/OUT pdfmark
1.17 -[
1.18 -/Title(Problem-/Anwendungsbereiche:)
1.19 -/Action/GoTo/Dest(subsection.1.2)cvn
1.20 -/OUT pdfmark
1.21 -[
1.22 -/Title(Literatur:)
1.23 -/Action/GoTo/Dest(subsection.1.3)cvn
1.24 -/OUT pdfmark
1.25 -[
1.26 -/Title(Divide and Conquer)
1.27 -/Count -5
1.28 -/Action/GoTo/Dest(section.2)cvn
1.29 -/OUT pdfmark
1.30 -[
1.31 -/Title(Formulierung des Divide and Conquer Prinzips)
1.32 -/Action/GoTo/Dest(subsection.2.1)cvn
1.33 -/OUT pdfmark
1.34 -[
1.35 -/Title(Quicksort)
1.36 -/Count -1
1.37 -/Action/GoTo/Dest(subsection.2.2)cvn
1.38 -/OUT pdfmark
1.39 -[
1.40 -/Title(Analyse)
1.41 -/Action/GoTo/Dest(subsubsection.2.2.1)cvn
1.42 -/OUT pdfmark
1.43 -[
1.44 -/Title(N\344chste Paare)
1.45 -/Count -2
1.46 -/Action/GoTo/Dest(subsection.2.3)cvn
1.47 -/OUT pdfmark
1.48 -[
1.49 -/Title(Algorithmus)
1.50 -/Action/GoTo/Dest(subsubsection.2.3.1)cvn
1.51 -/OUT pdfmark
1.52 -[
1.53 -/Title(Analyse)
1.54 -/Action/GoTo/Dest(subsubsection.2.3.2)cvn
1.55 -/OUT pdfmark
1.56 -[
1.57 -/Title(Segmentschnitt)
1.58 -/Count -2
1.59 -/Action/GoTo/Dest(subsection.2.4)cvn
1.60 -/OUT pdfmark
1.61 -[
1.62 -/Title(Algorithmus)
1.63 -/Action/GoTo/Dest(subsubsection.2.4.1)cvn
1.64 -/OUT pdfmark
1.65 -[
1.66 -/Title(Analyse)
1.67 -/Action/GoTo/Dest(subsubsection.2.4.2)cvn
1.68 -/OUT pdfmark
1.69 -[
1.70 -/Title(Polynomprodukt und Fast Fourier-Transformation)
1.71 -/Action/GoTo/Dest(subsection.2.5)cvn
1.72 -/OUT pdfmark
1.73 -[
1.74 -/Title(Randomisierung)
1.75 -/Count -1
1.76 -/Action/GoTo/Dest(section.3)cvn
1.77 -/OUT pdfmark
1.78 -[
1.79 -/Title(Hashing)
1.80 -/Action/GoTo/Dest(subsection.3.1)cvn
1.81 -/OUT pdfmark
1.82 -[
1.83 -/Title(Amortisierte Analyse)
1.84 -/Count -3
1.85 -/Action/GoTo/Dest(section.4)cvn
1.86 -/OUT pdfmark
1.87 -[
1.88 -/Title(Binomial Heaps)
1.89 -/Action/GoTo/Dest(subsection.4.1)cvn
1.90 -/OUT pdfmark
1.91 -[
1.92 -/Title(Fibonacci Heaps)
1.93 -/Action/GoTo/Dest(subsection.4.2)cvn
1.94 -/OUT pdfmark
1.95 -[
1.96 -/Title(Union Find)
1.97 -/Action/GoTo/Dest(subsection.4.3)cvn
1.98 -/OUT pdfmark
1.99 -[
1.100 -/Title(Greedy)
1.101 -/Count -1
1.102 -/Action/GoTo/Dest(section.5)cvn
1.103 -/OUT pdfmark
1.104 -[
1.105 -/Title(K\374rzeste \(billigste\) Wege)
1.106 -/Action/GoTo/Dest(subsection.5.1)cvn
1.107 -/OUT pdfmark
1.108 -[
1.109 -/Title(Bin Packing)
1.110 -/Count -2
1.111 -/Action/GoTo/Dest(section.6)cvn
1.112 -/OUT pdfmark
1.113 -[
1.114 -/Title(Online Verfahren)
1.115 -/Count -3
1.116 -/Action/GoTo/Dest(subsection.6.1)cvn
1.117 -/OUT pdfmark
1.118 -[
1.119 -/Title(Next Fit \(NF\))
1.120 -/Action/GoTo/Dest(subsubsection.6.1.1)cvn
1.121 -/OUT pdfmark
1.122 -[
1.123 -/Title(First-Fit \(FF\))
1.124 -/Action/GoTo/Dest(subsubsection.6.1.2)cvn
1.125 -/OUT pdfmark
1.126 -[
1.127 -/Title(Best-Fit \(BF\))
1.128 -/Action/GoTo/Dest(subsubsection.6.1.3)cvn
1.129 -/OUT pdfmark
1.130 -[
1.131 -/Title(Offline Verfahren)
1.132 -/Count -2
1.133 -/Action/GoTo/Dest(subsection.6.2)cvn
1.134 -/OUT pdfmark
1.135 -[
1.136 -/Title(First Fit Decreasing \(FFD oder FFNI\))
1.137 -/Action/GoTo/Dest(subsubsection.6.2.1)cvn
1.138 -/OUT pdfmark
1.139 -[
1.140 -/Title(Best Fit Decreasing \(BFD\))
1.141 -/Action/GoTo/Dest(subsubsection.6.2.2)cvn
1.142 -/OUT pdfmark
1.143 -[
1.144 -/Title(Dynamische Programmierung)
1.145 -/Action/GoTo/Dest(section.7)cvn
1.146 -/OUT pdfmark
1.147 -[
1.148 -/Title(Landau-Symbole)
1.149 -/Action/GoTo/Dest(appendix.A)cvn
1.150 -/OUT pdfmark