1.1 --- a/exzerpt.toc	Tue Feb 22 18:58:21 2011 +0100
     1.2 +++ /dev/null	Thu Jan 01 00:00:00 1970 +0000
     1.3 @@ -1,34 +0,0 @@
     1.4 -\select@language {ngerman}
     1.5 -\contentsline {section}{\numberline {1}Einleitung}{2}{section.1}
     1.6 -\contentsline {subsection}{\numberline {1.1}Themen:}{2}{subsection.1.1}
     1.7 -\contentsline {subsection}{\numberline {1.2}Problem-/Anwendungsbereiche:}{2}{subsection.1.2}
     1.8 -\contentsline {subsection}{\numberline {1.3}Literatur:}{2}{subsection.1.3}
     1.9 -\contentsline {section}{\numberline {2}Divide and Conquer}{3}{section.2}
    1.10 -\contentsline {subsection}{\numberline {2.1}Formulierung des Divide and Conquer Prinzips}{3}{subsection.2.1}
    1.11 -\contentsline {subsection}{\numberline {2.2}Quicksort}{3}{subsection.2.2}
    1.12 -\contentsline {subsubsection}{\numberline {2.2.1}Analyse}{3}{subsubsection.2.2.1}
    1.13 -\contentsline {subsection}{\numberline {2.3}N\"achste Paare}{3}{subsection.2.3}
    1.14 -\contentsline {subsubsection}{\numberline {2.3.1}Algorithmus}{3}{subsubsection.2.3.1}
    1.15 -\contentsline {subsubsection}{\numberline {2.3.2}Analyse}{4}{subsubsection.2.3.2}
    1.16 -\contentsline {subsection}{\numberline {2.4}Segmentschnitt}{4}{subsection.2.4}
    1.17 -\contentsline {subsubsection}{\numberline {2.4.1}Algorithmus}{4}{subsubsection.2.4.1}
    1.18 -\contentsline {subsubsection}{\numberline {2.4.2}Analyse}{5}{subsubsection.2.4.2}
    1.19 -\contentsline {subsection}{\numberline {2.5}Polynomprodukt und Fast Fourier-Transformation}{5}{subsection.2.5}
    1.20 -\contentsline {section}{\numberline {3}Randomisierung}{6}{section.3}
    1.21 -\contentsline {subsection}{\numberline {3.1}Hashing}{6}{subsection.3.1}
    1.22 -\contentsline {section}{\numberline {4}Amortisierte Analyse}{7}{section.4}
    1.23 -\contentsline {subsection}{\numberline {4.1}Binomial Heaps}{7}{subsection.4.1}
    1.24 -\contentsline {subsection}{\numberline {4.2}Fibonacci Heaps}{7}{subsection.4.2}
    1.25 -\contentsline {subsection}{\numberline {4.3}Union Find}{7}{subsection.4.3}
    1.26 -\contentsline {section}{\numberline {5}Greedy}{8}{section.5}
    1.27 -\contentsline {subsection}{\numberline {5.1}K\"urzeste (billigste) Wege}{8}{subsection.5.1}
    1.28 -\contentsline {section}{\numberline {6}Bin Packing}{9}{section.6}
    1.29 -\contentsline {subsection}{\numberline {6.1}Online Verfahren}{9}{subsection.6.1}
    1.30 -\contentsline {subsubsection}{\numberline {6.1.1}Next Fit (NF)}{9}{subsubsection.6.1.1}
    1.31 -\contentsline {subsubsection}{\numberline {6.1.2}First-Fit (FF)}{9}{subsubsection.6.1.2}
    1.32 -\contentsline {subsubsection}{\numberline {6.1.3}Best-Fit (BF)}{10}{subsubsection.6.1.3}
    1.33 -\contentsline {subsection}{\numberline {6.2}Offline Verfahren}{10}{subsection.6.2}
    1.34 -\contentsline {subsubsection}{\numberline {6.2.1}First Fit Decreasing (FFD oder FFNI)}{10}{subsubsection.6.2.1}
    1.35 -\contentsline {subsubsection}{\numberline {6.2.2}Best Fit Decreasing (BFD)}{10}{subsubsection.6.2.2}
    1.36 -\contentsline {section}{\numberline {7}Dynamische Programmierung}{11}{section.7}
    1.37 -\contentsline {section}{\numberline {A}Landau-Symbole}{12}{appendix.A}