1.1 --- a/exzerpt.out.ps Mon Jan 10 00:16:59 2011 +0100
1.2 +++ b/exzerpt.out.ps Thu Jan 20 00:56:20 2011 +0100
1.3 @@ -64,7 +64,7 @@
1.4 /Action/GoTo/Dest(subsubsection.2.4.2)cvn
1.5 /OUT pdfmark
1.6 [
1.7 -/Title(Fast Fourier-Transformation)
1.8 +/Title(Polynomprodukt und Fast Fourier-Transformation)
1.9 /Action/GoTo/Dest(subsection.2.5)cvn
1.10 /OUT pdfmark
1.11 [
1.12 @@ -95,14 +95,53 @@
1.13 /OUT pdfmark
1.14 [
1.15 /Title(Greedy)
1.16 +/Count -1
1.17 /Action/GoTo/Dest(section.5)cvn
1.18 /OUT pdfmark
1.19 [
1.20 -/Title(Anhang)
1.21 -/Count -1
1.22 +/Title(K\374rzeste \(billigste\) Wege)
1.23 +/Action/GoTo/Dest(subsection.5.1)cvn
1.24 +/OUT pdfmark
1.25 +[
1.26 +/Title(Bin Packing)
1.27 +/Count -2
1.28 /Action/GoTo/Dest(section.6)cvn
1.29 /OUT pdfmark
1.30 [
1.31 -/Title(Landau-Symbole)
1.32 +/Title(Online Verfahren)
1.33 +/Count -3
1.34 /Action/GoTo/Dest(subsection.6.1)cvn
1.35 /OUT pdfmark
1.36 +[
1.37 +/Title(Next Fit \(NF\))
1.38 +/Action/GoTo/Dest(subsubsection.6.1.1)cvn
1.39 +/OUT pdfmark
1.40 +[
1.41 +/Title(First-Fit \(FF\))
1.42 +/Action/GoTo/Dest(subsubsection.6.1.2)cvn
1.43 +/OUT pdfmark
1.44 +[
1.45 +/Title(Best-Fit \(BF\))
1.46 +/Action/GoTo/Dest(subsubsection.6.1.3)cvn
1.47 +/OUT pdfmark
1.48 +[
1.49 +/Title(Offline Verfahren)
1.50 +/Count -2
1.51 +/Action/GoTo/Dest(subsection.6.2)cvn
1.52 +/OUT pdfmark
1.53 +[
1.54 +/Title(First Fit Decreasing \(FFD oder FFNI\))
1.55 +/Action/GoTo/Dest(subsubsection.6.2.1)cvn
1.56 +/OUT pdfmark
1.57 +[
1.58 +/Title(Best Fit Decreasing \(BFD\))
1.59 +/Action/GoTo/Dest(subsubsection.6.2.2)cvn
1.60 +/OUT pdfmark
1.61 +[
1.62 +/Title(Dynamische Programmierung)
1.63 +/Action/GoTo/Dest(section.7)cvn
1.64 +/OUT pdfmark
1.65 +[
1.66 +/Title(Landau-Symbole)
1.67 +/Action/GoTo/Dest(appendix.A)cvn
1.68 +/OUT pdfmark