\relax 
\providecommand\hyper@newdestlabel[2]{}
\providecommand\HyField@AuxAddToFields[1]{}
\providecommand\HyField@AuxAddToCoFields[2]{}
\@writefile{toc}{\contentsline {section}{\numberline {1}Beweismuster: einmal verstehen, überall anwenden}{2}{section.1}\protected@file@percent }
\@writefile{toc}{\contentsline {subsection}{A1\ \ Longest Path $\in $ NP (Dreischritt)}{2}{section*.2}\protected@file@percent }
\@writefile{toc}{\contentsline {subsection}{A2\ \ NDTM-Definition $\subseteq $ Verifizierer-Definition}{4}{section*.3}\protected@file@percent }
\@writefile{toc}{\contentsline {subsection}{A3\ \ Vererbung der NP-Vollständigkeit}{6}{section*.4}\protected@file@percent }
\@writefile{toc}{\contentsline {subsection}{A4\ \ $k$-Clique ist NP-vollständig}{7}{section*.5}\protected@file@percent }
\@writefile{toc}{\contentsline {subsection}{A5\ \ Lower Bounds: VertexCover}{10}{section*.6}\protected@file@percent }
\@writefile{toc}{\contentsline {subsection}{A6\ \ ListScheduling hat Güte $2 - \frac  {1}{m}$}{12}{section*.7}\protected@file@percent }
\@writefile{toc}{\contentsline {subsection}{A7\ \ ListScheduling: scharfe Worst-Case-Instanzen}{14}{section*.8}\protected@file@percent }
\@writefile{toc}{\contentsline {subsection}{A8\ \ Fragen über Fragen II}{15}{section*.9}\protected@file@percent }
\@writefile{toc}{\contentsline {section}{\numberline {2}Konstruktions-Familien: an einem Beispiel lernen, dann ableiten}{16}{section.2}\protected@file@percent }
\@writefile{toc}{\contentsline {subsection}{A9\ \ FeedbackVertexSet ist NP-vollständig}{16}{section*.10}\protected@file@percent }
\@writefile{toc}{\contentsline {subsection}{A10\ \ 3-COLOR mit Minimalgrad 3 ist NP-vollständig}{18}{section*.11}\protected@file@percent }
\@writefile{toc}{\contentsline {subsection}{A11\ \ SAT $\leq _{p}$ 3-SAT}{20}{section*.12}\protected@file@percent }
\@writefile{toc}{\contentsline {subsection}{A12\ \ CliqueAndIndependentSet ist NP-schwer}{22}{section*.13}\protected@file@percent }
\@writefile{toc}{\contentsline {subsection}{A13\ \ SubsetSum $\leq _{p}$ Partition}{24}{section*.14}\protected@file@percent }
\@writefile{toc}{\contentsline {subsection}{A14\ \ SubsetSum mit Teilbarkeit ist NP-vollständig}{26}{section*.15}\protected@file@percent }
\@writefile{toc}{\contentsline {subsection}{A15\ \ AtMostTwoPerSize-SubsetSum ist NP-schwer}{28}{section*.16}\protected@file@percent }
\@writefile{toc}{\contentsline {subsection}{A16\ \ VertexCover ist NP-vollständig}{30}{section*.17}\protected@file@percent }
\@writefile{toc}{\contentsline {subsection}{A17\ \ TSP ist nicht approximierbar}{32}{section*.18}\protected@file@percent }
\@writefile{toc}{\contentsline {subsection}{A18\ \ $k$-CLIQUE-DEG-3 ist NP-vollständig}{34}{section*.19}\protected@file@percent }
\@writefile{toc}{\contentsline {section}{\numberline {3}Verfahren und Einzelmuster: einzeln lernen}{37}{section.3}\protected@file@percent }
\@writefile{toc}{\contentsline {subsection}{A19\ \ Knapsack: Greedy und ModifiedGreedy}{37}{section*.20}\protected@file@percent }
\@writefile{toc}{\contentsline {subsection}{A20\ \ LPT anwenden}{39}{section*.21}\protected@file@percent }
\@writefile{toc}{\contentsline {subsection}{A21\ \ $\Delta $TSP1 anwenden + Verständnisfragen}{40}{section*.22}\protected@file@percent }
\@writefile{toc}{\contentsline {subsection}{A22\ \ Christofides anwenden ($K_4$)}{42}{section*.23}\protected@file@percent }
\@writefile{toc}{\contentsline {subsection}{A23\ \ Parallel-Task-Scheduling}{44}{section*.24}\protected@file@percent }
\@writefile{toc}{\contentsline {subsection}{A24\ \ Strip Packing: NFDH}{46}{section*.25}\protected@file@percent }
\@writefile{toc}{\contentsline {subsection}{A25\ \ TM für Palindrome}{48}{section*.26}\protected@file@percent }
\gdef \@abspage@last{48}
