mm
authorlindenmannm
Tue, 22 Feb 2011 19:05:54 +0100
changeset 442740b6ed3a7
parent 3 0d0e9abd157b
child 6 37644b2389bd
mm
comp.log
exzerpt.aux
exzerpt.bbl
exzerpt.blg
exzerpt.dvi
exzerpt.log
exzerpt.out.ps
exzerpt.tex
exzerpt.toc
     1.1 --- a/comp.log	Tue Feb 22 19:02:39 2011 +0100
     1.2 +++ /dev/null	Thu Jan 01 00:00:00 1970 +0000
     1.3 @@ -1,252 +0,0 @@
     1.4 -This is pdfTeX, Version 3.1415926-1.40.10 (MiKTeX 2.8)
     1.5 -entering extended mode
     1.6 -
     1.7 -(M:/Documents/004_Uni-Freiburg/VLR/Semester_1/Algorithmentheorie/Exzerpt/algori
     1.8 -thms_theory/exzerpt.tex
     1.9 -LaTeX2e <2009/09/24>
    1.10 -Babel <v3.8l> and hyphenation patterns for english, dumylang, nohyphenation, ge
    1.11 -rman, ngerman, german-x-2009-06-19, ngerman-x-2009-06-19, french, loaded.
    1.12 -("C:\Program Files\MikTex\tex\latex\base\article.cls"
    1.13 -Document Class: article 2007/10/19 v1.4h Standard LaTeX document class
    1.14 -("C:\Program Files\MikTex\tex\latex\base\size11.clo"))
    1.15 -("C:\Program Files\MikTex\tex\generic\babel\babel.sty"
    1.16 -*************************************
    1.17 -* Local config file bblopts.cfg used
    1.18 -*
    1.19 -("C:\Program Files\MikTex\tex\latex\00miktex\bblopts.cfg")
    1.20 -("C:\Program Files\MikTex\tex\generic\babel\ngermanb.ldf"
    1.21 -("C:\Program Files\MikTex\tex\generic\babel\babel.def")))
    1.22 -("C:\Program Files\MikTex\tex\latex\base\fontenc.sty"
    1.23 -("C:\Program Files\MikTex\tex\latex\base\t1enc.def"))
    1.24 -("C:\Program Files\MikTex\tex\latex\base\inputenc.sty"
    1.25 -("C:\Program Files\MikTex\tex\latex\base\latin1.def"))
    1.26 -("C:\Program Files\MikTex\tex\latex\hyperref\hyperref.sty"
    1.27 -("C:\Program Files\MikTex\tex\generic\oberdiek\ltxcmds.sty")
    1.28 -("C:\Program Files\MikTex\tex\generic\oberdiek\infwarerr.sty")
    1.29 -("C:\Program Files\MikTex\tex\latex\graphics\keyval.sty")
    1.30 -("C:\Program Files\MikTex\tex\generic\oberdiek\kvsetkeys.sty"
    1.31 -("C:\Program Files\MikTex\tex\generic\oberdiek\etexcmds.sty"))
    1.32 -("C:\Program Files\MikTex\tex\generic\oberdiek\pdfescape.sty"
    1.33 -("C:\Program Files\MikTex\tex\generic\oberdiek\pdftexcmds.sty"
    1.34 -("C:\Program Files\MikTex\tex\generic\oberdiek\ifluatex.sty")))
    1.35 -("C:\Program Files\MikTex\tex\generic\oberdiek\ifpdf.sty")
    1.36 -("C:\Program Files\MikTex\tex\generic\oberdiek\ifvtex.sty")
    1.37 -("C:\Program Files\MikTex\tex\generic\ifxetex\ifxetex.sty")
    1.38 -("C:\Program Files\MikTex\tex\latex\oberdiek\hycolor.sty"
    1.39 -("C:\Program Files\MikTex\tex\latex\oberdiek\xcolor-patch.sty"))
    1.40 -("C:\Program Files\MikTex\tex\latex\oberdiek\letltxmacro.sty")
    1.41 -("C:\Program Files\MikTex\tex\latex\oberdiek\kvoptions.sty")
    1.42 -("C:\Program Files\MikTex\tex\latex\hyperref\pd1enc.def")
    1.43 -("C:\Program Files\MikTex\tex\generic\oberdiek\intcalc.sty")
    1.44 -("C:\Program Files\MikTex\tex\latex\00miktex\hyperref.cfg")
    1.45 -("C:\Program Files\MikTex\tex\latex\ltxmisc\url.sty")
    1.46 -("C:\Program Files\MikTex\tex\generic\oberdiek\bitset.sty"
    1.47 -("C:\Program Files\MikTex\tex\generic\oberdiek\bigintcalc.sty"))
    1.48 -("C:\Program Files\MikTex\tex\generic\oberdiek\atbegshi.sty"))
    1.49 -
    1.50 -Package hyperref Message: Driver (default): hdvips.
    1.51 -
    1.52 -("C:\Program Files\MikTex\tex\latex\hyperref\hdvips.def"
    1.53 -("C:\Program Files\MikTex\tex\latex\hyperref\pdfmark.def"
    1.54 -("C:\Program Files\MikTex\tex\latex\oberdiek\rerunfilecheck.sty"
    1.55 -("C:\Program Files\MikTex\tex\latex\oberdiek\atveryend.sty")
    1.56 -("C:\Program Files\MikTex\tex\generic\oberdiek\uniquecounter.sty"))))
    1.57 -("C:\Program Files\MikTex\tex\latex\vaucanson-g\vaucanson-g.sty"
    1.58 -("C:\Program Files\MikTex\tex\latex\base\ifthen.sty")
    1.59 -("C:\Program Files\MikTex\tex\latex\xcolor\xcolor.sty"
    1.60 -("C:\Program Files\MikTex\tex\latex\00miktex\color.cfg")
    1.61 -("C:\Program Files\MikTex\tex\latex\graphics\dvips.def"))
    1.62 -("C:\Program Files\MikTex\tex\generic\vaucanson-g\VCColor-names.def")
    1.63 -("C:\Program Files\MikTex\tex\latex\pstricks\pstricks.sty"
    1.64 -("C:\Program Files\MikTex\tex\generic\pstricks\pstricks.tex"
    1.65 -("C:\Program Files\MikTex\tex\generic\xkeyval\pst-xkey.tex"
    1.66 -("C:\Program Files\MikTex\tex\latex\xkeyval\xkeyval.sty"
    1.67 -("C:\Program Files\MikTex\tex\generic\xkeyval\xkeyval.tex")))
    1.68 -("C:\Program Files\MikTex\tex\generic\pstricks\pst-fp.tex"
    1.69 -`pst-fp' v0.05, 2010/01/17 (hv))
    1.70 -`PSTricks' v2.12  <2010/09/16> (tvz)
    1.71 -("C:\Program Files\MikTex\tex\generic\pstricks\pstricks.con"))
    1.72 -("C:\Program Files\MikTex\tex\generic\pstricks\pst-fp.tex"))
    1.73 -("C:\Program Files\MikTex\tex\latex\pst-node\pst-node.sty"
    1.74 -("C:\Program Files\MikTex\tex\generic\pst-node\pst-node.tex"
    1.75 - v1.13, 2010/06/06)) ("C:\Program Files\MikTex\tex\latex\pst-plot\pst-plot.sty"
    1.76 -("C:\Program Files\MikTex\tex\generic\pst-plot\pst-plot.tex"
    1.77 -("C:\Program Files\MikTex\tex\generic\multido\multido.tex"
    1.78 - v1.42, 2010/05/14 <tvz>)  v1.21, 2010/09/28 (tvz,hv)))
    1.79 -("C:\Program Files\MikTex\tex\latex\pst-coil\pst-coil.sty"
    1.80 -("C:\Program Files\MikTex\tex\generic\pst-coil\pst-coil.tex"
    1.81 - v1.21, 2010/09/28)) ("C:\Program Files\MikTex\tex\latex\multido\multido.sty")
    1.82 -("C:\Program Files\MikTex\tex\latex\pst-3d\pst-3d.sty"
    1.83 -("C:\Program Files\MikTex\tex\generic\pst-3d\pst-3d.tex"
    1.84 -`PST-3d' v1.11, 2010/02/14 (tvz)))
    1.85 -("C:\Program Files\MikTex\tex\latex\tools\calc.sty")
    1.86 -("C:\Program Files\MikTex\tex\generic\vaucanson-g\Vaucanson-G.tex")
    1.87 -("C:\Program Files\MikTex\tex\generic\vaucanson-g\VCPref-default.tex"))
    1.88 -("C:\Program Files\MikTex\tex\latex\oberdiek\hypcap.sty")
    1.89 -("C:\Program Files\MikTex\tex\latex\fancyhdr\fancyhdr.sty")
    1.90 -("C:\Program Files\MikTex\tex\latex\graphics\graphicx.sty"
    1.91 -("C:\Program Files\MikTex\tex\latex\graphics\graphics.sty"
    1.92 -("C:\Program Files\MikTex\tex\latex\graphics\trig.sty")
    1.93 -("C:\Program Files\MikTex\tex\latex\00miktex\graphics.cfg")))
    1.94 -("C:\Program Files\MikTex\tex\latex\lastpage\lastpage.sty")
    1.95 -("C:\Program Files\MikTex\tex\latex\preprint\fullpage.sty")
    1.96 -("C:\Program Files\MikTex\tex\latex\ams\classes\amsthm.sty")
    1.97 -("C:\Program Files\MikTex\tex\latex\ams\math\amsmath.sty"
    1.98 -For additional information on amsmath, use the `?' option.
    1.99 -("C:\Program Files\MikTex\tex\latex\ams\math\amstext.sty"
   1.100 -("C:\Program Files\MikTex\tex\latex\ams\math\amsgen.sty"))
   1.101 -("C:\Program Files\MikTex\tex\latex\ams\math\amsbsy.sty")
   1.102 -("C:\Program Files\MikTex\tex\latex\ams\math\amsopn.sty"))
   1.103 -("C:\Program Files\MikTex\tex\latex\amsfonts\amsfonts.sty")
   1.104 -("C:\Program Files\MikTex\tex\latex\float\float.sty")
   1.105 -("C:\Program Files\MikTex\tex\latex\paralist\paralist.sty")
   1.106 -("C:\Program Files\MikTex\tex\latex\listings\listings.sty"
   1.107 -("C:\Program Files\MikTex\tex\latex\listings\lstmisc.sty")
   1.108 -("C:\Program Files\MikTex\tex\latex\listings\listings.cfg"))
   1.109 -("C:\Program Files\MikTex\tex\latex\oberdiek\bookmark.sty"
   1.110 -("C:\Program Files\MikTex\tex\latex\oberdiek\auxhook.sty")
   1.111 -("C:\Program Files\MikTex\tex\latex\oberdiek\bkm-dvips.def"))
   1.112 -(M:\Documents\004_Uni-Freiburg\VLR\Semester_1\Algorithmentheorie\Exzerpt\algori
   1.113 -thms_theory\exzerpt.aux)
   1.114 -("C:\Program Files\MikTex\tex\latex\hyperref\nameref.sty"
   1.115 -("C:\Program Files\MikTex\tex\latex\oberdiek\refcount.sty")
   1.116 -("C:\Program Files\MikTex\tex\generic\oberdiek\gettitlestring.sty"))
   1.117 -("C:\Program Files\MikTex\tex\latex\amsfonts\umsa.fd")
   1.118 -("C:\Program Files\MikTex\tex\latex\amsfonts\umsb.fd")
   1.119 -(M:\Documents\004_Uni-Freiburg\VLR\Semester_1\Algorithmentheorie\Exzerpt\algori
   1.120 -thms_theory\exzerpt.toc) [1] ("C:\Program Files\MikTex\tex\latex\base\t1cmtt.fd
   1.121 -")
   1.122 -(M:\Documents\004_Uni-Freiburg\VLR\Semester_1\Algorithmentheorie\Exzerpt\algori
   1.123 -thms_theory\exzerpt.bbl) [2] [3] <img/cl_pair.eps> [4] [5] [6] [7] [8] [9]
   1.124 -[10] [11] <img/landau_sym.eps> AED: lastpage setting LastPage 
   1.125 -[12]
   1.126 -(M:\Documents\004_Uni-Freiburg\VLR\Semester_1\Algorithmentheorie\Exzerpt\algori
   1.127 -thms_theory\exzerpt.aux) )
   1.128 -Output written on exzerpt.dvi (12 pages, 55792 bytes).
   1.129 -Transcript written on exzerpt.log.
   1.130 -This is pdfTeX, Version 3.1415926-1.40.10 (MiKTeX 2.8)
   1.131 -entering extended mode
   1.132 -
   1.133 -(M:/Documents/004_Uni-Freiburg/VLR/Semester_1/Algorithmentheorie/Exzerpt/algori
   1.134 -thms_theory/exzerpt.tex
   1.135 -LaTeX2e <2009/09/24>
   1.136 -Babel <v3.8l> and hyphenation patterns for english, dumylang, nohyphenation, ge
   1.137 -rman, ngerman, german-x-2009-06-19, ngerman-x-2009-06-19, french, loaded.
   1.138 -("C:\Program Files\MikTex\tex\latex\base\article.cls"
   1.139 -Document Class: article 2007/10/19 v1.4h Standard LaTeX document class
   1.140 -("C:\Program Files\MikTex\tex\latex\base\size11.clo"))
   1.141 -("C:\Program Files\MikTex\tex\generic\babel\babel.sty"
   1.142 -*************************************
   1.143 -* Local config file bblopts.cfg used
   1.144 -*
   1.145 -("C:\Program Files\MikTex\tex\latex\00miktex\bblopts.cfg")
   1.146 -("C:\Program Files\MikTex\tex\generic\babel\ngermanb.ldf"
   1.147 -("C:\Program Files\MikTex\tex\generic\babel\babel.def")))
   1.148 -("C:\Program Files\MikTex\tex\latex\base\fontenc.sty"
   1.149 -("C:\Program Files\MikTex\tex\latex\base\t1enc.def"))
   1.150 -("C:\Program Files\MikTex\tex\latex\base\inputenc.sty"
   1.151 -("C:\Program Files\MikTex\tex\latex\base\latin1.def"))
   1.152 -("C:\Program Files\MikTex\tex\latex\hyperref\hyperref.sty"
   1.153 -("C:\Program Files\MikTex\tex\generic\oberdiek\ltxcmds.sty")
   1.154 -("C:\Program Files\MikTex\tex\generic\oberdiek\infwarerr.sty")
   1.155 -("C:\Program Files\MikTex\tex\latex\graphics\keyval.sty")
   1.156 -("C:\Program Files\MikTex\tex\generic\oberdiek\kvsetkeys.sty"
   1.157 -("C:\Program Files\MikTex\tex\generic\oberdiek\etexcmds.sty"))
   1.158 -("C:\Program Files\MikTex\tex\generic\oberdiek\pdfescape.sty"
   1.159 -("C:\Program Files\MikTex\tex\generic\oberdiek\pdftexcmds.sty"
   1.160 -("C:\Program Files\MikTex\tex\generic\oberdiek\ifluatex.sty")))
   1.161 -("C:\Program Files\MikTex\tex\generic\oberdiek\ifpdf.sty")
   1.162 -("C:\Program Files\MikTex\tex\generic\oberdiek\ifvtex.sty")
   1.163 -("C:\Program Files\MikTex\tex\generic\ifxetex\ifxetex.sty")
   1.164 -("C:\Program Files\MikTex\tex\latex\oberdiek\hycolor.sty"
   1.165 -("C:\Program Files\MikTex\tex\latex\oberdiek\xcolor-patch.sty"))
   1.166 -("C:\Program Files\MikTex\tex\latex\oberdiek\letltxmacro.sty")
   1.167 -("C:\Program Files\MikTex\tex\latex\oberdiek\kvoptions.sty")
   1.168 -("C:\Program Files\MikTex\tex\latex\hyperref\pd1enc.def")
   1.169 -("C:\Program Files\MikTex\tex\generic\oberdiek\intcalc.sty")
   1.170 -("C:\Program Files\MikTex\tex\latex\00miktex\hyperref.cfg")
   1.171 -("C:\Program Files\MikTex\tex\latex\ltxmisc\url.sty")
   1.172 -("C:\Program Files\MikTex\tex\generic\oberdiek\bitset.sty"
   1.173 -("C:\Program Files\MikTex\tex\generic\oberdiek\bigintcalc.sty"))
   1.174 -("C:\Program Files\MikTex\tex\generic\oberdiek\atbegshi.sty"))
   1.175 -
   1.176 -Package hyperref Message: Driver (default): hdvips.
   1.177 -
   1.178 -("C:\Program Files\MikTex\tex\latex\hyperref\hdvips.def"
   1.179 -("C:\Program Files\MikTex\tex\latex\hyperref\pdfmark.def"
   1.180 -("C:\Program Files\MikTex\tex\latex\oberdiek\rerunfilecheck.sty"
   1.181 -("C:\Program Files\MikTex\tex\latex\oberdiek\atveryend.sty")
   1.182 -("C:\Program Files\MikTex\tex\generic\oberdiek\uniquecounter.sty"))))
   1.183 -("C:\Program Files\MikTex\tex\latex\vaucanson-g\vaucanson-g.sty"
   1.184 -("C:\Program Files\MikTex\tex\latex\base\ifthen.sty")
   1.185 -("C:\Program Files\MikTex\tex\latex\xcolor\xcolor.sty"
   1.186 -("C:\Program Files\MikTex\tex\latex\00miktex\color.cfg")
   1.187 -("C:\Program Files\MikTex\tex\latex\graphics\dvips.def"))
   1.188 -("C:\Program Files\MikTex\tex\generic\vaucanson-g\VCColor-names.def")
   1.189 -("C:\Program Files\MikTex\tex\latex\pstricks\pstricks.sty"
   1.190 -("C:\Program Files\MikTex\tex\generic\pstricks\pstricks.tex"
   1.191 -("C:\Program Files\MikTex\tex\generic\xkeyval\pst-xkey.tex"
   1.192 -("C:\Program Files\MikTex\tex\latex\xkeyval\xkeyval.sty"
   1.193 -("C:\Program Files\MikTex\tex\generic\xkeyval\xkeyval.tex")))
   1.194 -("C:\Program Files\MikTex\tex\generic\pstricks\pst-fp.tex"
   1.195 -`pst-fp' v0.05, 2010/01/17 (hv))
   1.196 -`PSTricks' v2.12  <2010/09/16> (tvz)
   1.197 -("C:\Program Files\MikTex\tex\generic\pstricks\pstricks.con"))
   1.198 -("C:\Program Files\MikTex\tex\generic\pstricks\pst-fp.tex"))
   1.199 -("C:\Program Files\MikTex\tex\latex\pst-node\pst-node.sty"
   1.200 -("C:\Program Files\MikTex\tex\generic\pst-node\pst-node.tex"
   1.201 - v1.13, 2010/06/06)) ("C:\Program Files\MikTex\tex\latex\pst-plot\pst-plot.sty"
   1.202 -("C:\Program Files\MikTex\tex\generic\pst-plot\pst-plot.tex"
   1.203 -("C:\Program Files\MikTex\tex\generic\multido\multido.tex"
   1.204 - v1.42, 2010/05/14 <tvz>)  v1.21, 2010/09/28 (tvz,hv)))
   1.205 -("C:\Program Files\MikTex\tex\latex\pst-coil\pst-coil.sty"
   1.206 -("C:\Program Files\MikTex\tex\generic\pst-coil\pst-coil.tex"
   1.207 - v1.21, 2010/09/28)) ("C:\Program Files\MikTex\tex\latex\multido\multido.sty")
   1.208 -("C:\Program Files\MikTex\tex\latex\pst-3d\pst-3d.sty"
   1.209 -("C:\Program Files\MikTex\tex\generic\pst-3d\pst-3d.tex"
   1.210 -`PST-3d' v1.11, 2010/02/14 (tvz)))
   1.211 -("C:\Program Files\MikTex\tex\latex\tools\calc.sty")
   1.212 -("C:\Program Files\MikTex\tex\generic\vaucanson-g\Vaucanson-G.tex")
   1.213 -("C:\Program Files\MikTex\tex\generic\vaucanson-g\VCPref-default.tex"))
   1.214 -("C:\Program Files\MikTex\tex\latex\oberdiek\hypcap.sty")
   1.215 -("C:\Program Files\MikTex\tex\latex\fancyhdr\fancyhdr.sty")
   1.216 -("C:\Program Files\MikTex\tex\latex\graphics\graphicx.sty"
   1.217 -("C:\Program Files\MikTex\tex\latex\graphics\graphics.sty"
   1.218 -("C:\Program Files\MikTex\tex\latex\graphics\trig.sty")
   1.219 -("C:\Program Files\MikTex\tex\latex\00miktex\graphics.cfg")))
   1.220 -("C:\Program Files\MikTex\tex\latex\lastpage\lastpage.sty")
   1.221 -("C:\Program Files\MikTex\tex\latex\preprint\fullpage.sty")
   1.222 -("C:\Program Files\MikTex\tex\latex\ams\classes\amsthm.sty")
   1.223 -("C:\Program Files\MikTex\tex\latex\ams\math\amsmath.sty"
   1.224 -For additional information on amsmath, use the `?' option.
   1.225 -("C:\Program Files\MikTex\tex\latex\ams\math\amstext.sty"
   1.226 -("C:\Program Files\MikTex\tex\latex\ams\math\amsgen.sty"))
   1.227 -("C:\Program Files\MikTex\tex\latex\ams\math\amsbsy.sty")
   1.228 -("C:\Program Files\MikTex\tex\latex\ams\math\amsopn.sty"))
   1.229 -("C:\Program Files\MikTex\tex\latex\amsfonts\amsfonts.sty")
   1.230 -("C:\Program Files\MikTex\tex\latex\float\float.sty")
   1.231 -("C:\Program Files\MikTex\tex\latex\paralist\paralist.sty")
   1.232 -("C:\Program Files\MikTex\tex\latex\listings\listings.sty"
   1.233 -("C:\Program Files\MikTex\tex\latex\listings\lstmisc.sty")
   1.234 -("C:\Program Files\MikTex\tex\latex\listings\listings.cfg"))
   1.235 -("C:\Program Files\MikTex\tex\latex\oberdiek\bookmark.sty"
   1.236 -("C:\Program Files\MikTex\tex\latex\oberdiek\auxhook.sty")
   1.237 -("C:\Program Files\MikTex\tex\latex\oberdiek\bkm-dvips.def"))
   1.238 -(M:\Documents\004_Uni-Freiburg\VLR\Semester_1\Algorithmentheorie\Exzerpt\algori
   1.239 -thms_theory\exzerpt.aux)
   1.240 -("C:\Program Files\MikTex\tex\latex\hyperref\nameref.sty"
   1.241 -("C:\Program Files\MikTex\tex\latex\oberdiek\refcount.sty")
   1.242 -("C:\Program Files\MikTex\tex\generic\oberdiek\gettitlestring.sty"))
   1.243 -("C:\Program Files\MikTex\tex\latex\amsfonts\umsa.fd")
   1.244 -("C:\Program Files\MikTex\tex\latex\amsfonts\umsb.fd")
   1.245 -(M:\Documents\004_Uni-Freiburg\VLR\Semester_1\Algorithmentheorie\Exzerpt\algori
   1.246 -thms_theory\exzerpt.toc) [1] ("C:\Program Files\MikTex\tex\latex\base\t1cmtt.fd
   1.247 -")
   1.248 -(M:\Documents\004_Uni-Freiburg\VLR\Semester_1\Algorithmentheorie\Exzerpt\algori
   1.249 -thms_theory\exzerpt.bbl) [2] [3] <img/cl_pair.eps> [4] [5] [6] [7] [8] [9]
   1.250 -[10] [11] <img/landau_sym.eps> AED: lastpage setting LastPage 
   1.251 -[12]
   1.252 -(M:\Documents\004_Uni-Freiburg\VLR\Semester_1\Algorithmentheorie\Exzerpt\algori
   1.253 -thms_theory\exzerpt.aux) )
   1.254 -Output written on exzerpt.dvi (12 pages, 55792 bytes).
   1.255 -Transcript written on exzerpt.log.
     2.1 --- a/exzerpt.aux	Tue Feb 22 19:02:39 2011 +0100
     2.2 +++ /dev/null	Thu Jan 01 00:00:00 1970 +0000
     2.3 @@ -1,101 +0,0 @@
     2.4 -\relax 
     2.5 -\providecommand\BKM@entry[2]{}
     2.6 -\catcode`"\active
     2.7 -\providecommand\HyperFirstAtBeginDocument{\AtBeginDocument}
     2.8 -\HyperFirstAtBeginDocument{\ifx\hyper@anchor\@undefined
     2.9 -\global\let\oldcontentsline\contentsline
    2.10 -\gdef\contentsline#1#2#3#4{\oldcontentsline{#1}{#2}{#3}}
    2.11 -\global\let\oldnewlabel\newlabel
    2.12 -\gdef\newlabel#1#2{\newlabelxx{#1}#2}
    2.13 -\gdef\newlabelxx#1#2#3#4#5#6{\oldnewlabel{#1}{{#2}{#3}}}
    2.14 -\AtEndDocument{\ifx\hyper@anchor\@undefined
    2.15 -\let\contentsline\oldcontentsline
    2.16 -\let\newlabel\oldnewlabel
    2.17 -\fi}
    2.18 -\fi}
    2.19 -\global\let\hyper@last\relax 
    2.20 -\gdef\HyperFirstAtBeginDocument#1{#1}
    2.21 -\providecommand*\HyPL@Entry[1]{}
    2.22 -\bibstyle{alphadin}
    2.23 -\HyPL@Entry{0<</S/D>>}
    2.24 -\select@language{ngerman}
    2.25 -\@writefile{toc}{\select@language{ngerman}}
    2.26 -\@writefile{lof}{\select@language{ngerman}}
    2.27 -\@writefile{lot}{\select@language{ngerman}}
    2.28 -\BKM@entry{id=1,dest={73656374696F6E2E31}}{45696E6C656974756E67}
    2.29 -\BKM@entry{id=2,dest={73756273656374696F6E2E312E31}}{5468656D656E3A}
    2.30 -\BKM@entry{id=3,dest={73756273656374696F6E2E312E32}}{50726F626C656D2D2F416E77656E64756E677362657265696368653A}
    2.31 -\BKM@entry{id=4,dest={73756273656374696F6E2E312E33}}{4C69746572617475723A}
    2.32 -\bibdata{literatur}
    2.33 -\bibcite{2}{PW02}
    2.34 -\bibcite{1}{THC01}
    2.35 -\citation{*}
    2.36 -\@writefile{toc}{\contentsline {section}{\numberline {1}Einleitung}{2}{section.1}}
    2.37 -\newlabel{sec:intro}{{1}{2}{Einleitung\relax }{section.1}{}}
    2.38 -\@writefile{toc}{\contentsline {subsection}{\numberline {1.1}Themen:}{2}{subsection.1.1}}
    2.39 -\@writefile{toc}{\contentsline {subsection}{\numberline {1.2}Problem-/Anwendungsbereiche:}{2}{subsection.1.2}}
    2.40 -\@writefile{toc}{\contentsline {subsection}{\numberline {1.3}Literatur:}{2}{subsection.1.3}}
    2.41 -\BKM@entry{id=5,dest={73656374696F6E2E32}}{44697669646520616E6420436F6E71756572}
    2.42 -\BKM@entry{id=6,dest={73756273656374696F6E2E322E31}}{466F726D756C696572756E67206465732044697669646520616E6420436F6E71756572205072696E7A697073}
    2.43 -\BKM@entry{id=7,dest={73756273656374696F6E2E322E32}}{517569636B736F7274}
    2.44 -\BKM@entry{id=8,dest={73756273756273656374696F6E2E322E322E31}}{416E616C797365}
    2.45 -\BKM@entry{id=9,dest={73756273656374696F6E2E322E33}}{4E5C3334346368737465205061617265}
    2.46 -\BKM@entry{id=10,dest={73756273756273656374696F6E2E322E332E31}}{416C676F726974686D7573}
    2.47 -\@writefile{toc}{\contentsline {section}{\numberline {2}Divide and Conquer}{3}{section.2}}
    2.48 -\newlabel{sec:div&conq}{{2}{3}{Divide and Conquer\relax }{section.2}{}}
    2.49 -\@writefile{toc}{\contentsline {subsection}{\numberline {2.1}Formulierung des Divide and Conquer Prinzips}{3}{subsection.2.1}}
    2.50 -\@writefile{toc}{\contentsline {subsection}{\numberline {2.2}Quicksort}{3}{subsection.2.2}}
    2.51 -\@writefile{toc}{\contentsline {subsubsection}{\numberline {2.2.1}Analyse}{3}{subsubsection.2.2.1}}
    2.52 -\@writefile{toc}{\contentsline {subsection}{\numberline {2.3}N\"achste Paare}{3}{subsection.2.3}}
    2.53 -\@writefile{toc}{\contentsline {subsubsection}{\numberline {2.3.1}Algorithmus}{3}{subsubsection.2.3.1}}
    2.54 -\BKM@entry{id=11,dest={73756273756273656374696F6E2E322E332E32}}{416E616C797365}
    2.55 -\BKM@entry{id=12,dest={73756273656374696F6E2E322E34}}{5365676D656E747363686E697474}
    2.56 -\BKM@entry{id=13,dest={73756273756273656374696F6E2E322E342E31}}{416C676F726974686D7573}
    2.57 -\@writefile{lof}{\contentsline {figure}{\numberline {1}{\ignorespaces N\"achste Paare: Pr\"uf Distanz}}{4}{figure.1}}
    2.58 -\newlabel{cl_pair}{{1}{4}{Nächste Paare: Prüf Distanz\relax }{figure.1}{}}
    2.59 -\@writefile{toc}{\contentsline {subsubsection}{\numberline {2.3.2}Analyse}{4}{subsubsection.2.3.2}}
    2.60 -\@writefile{toc}{\contentsline {subsection}{\numberline {2.4}Segmentschnitt}{4}{subsection.2.4}}
    2.61 -\@writefile{toc}{\contentsline {subsubsection}{\numberline {2.4.1}Algorithmus}{4}{subsubsection.2.4.1}}
    2.62 -\BKM@entry{id=14,dest={73756273756273656374696F6E2E322E342E32}}{416E616C797365}
    2.63 -\BKM@entry{id=15,dest={73756273656374696F6E2E322E35}}{506F6C796E6F6D70726F64756B7420756E64204661737420466F75726965722D5472616E73666F726D6174696F6E}
    2.64 -\@writefile{toc}{\contentsline {subsubsection}{\numberline {2.4.2}Analyse}{5}{subsubsection.2.4.2}}
    2.65 -\@writefile{toc}{\contentsline {subsection}{\numberline {2.5}Polynomprodukt und Fast Fourier-Transformation}{5}{subsection.2.5}}
    2.66 -\BKM@entry{id=16,dest={73656374696F6E2E33}}{52616E646F6D6973696572756E67}
    2.67 -\BKM@entry{id=17,dest={73756273656374696F6E2E332E31}}{48617368696E67}
    2.68 -\@writefile{toc}{\contentsline {section}{\numberline {3}Randomisierung}{6}{section.3}}
    2.69 -\@writefile{toc}{\contentsline {subsection}{\numberline {3.1}Hashing}{6}{subsection.3.1}}
    2.70 -\BKM@entry{id=18,dest={73656374696F6E2E34}}{416D6F72746973696572746520416E616C797365}
    2.71 -\BKM@entry{id=19,dest={73756273656374696F6E2E342E31}}{42696E6F6D69616C204865617073}
    2.72 -\BKM@entry{id=20,dest={73756273656374696F6E2E342E32}}{4669626F6E61636369204865617073}
    2.73 -\BKM@entry{id=21,dest={73756273656374696F6E2E342E33}}{556E696F6E2046696E64}
    2.74 -\@writefile{toc}{\contentsline {section}{\numberline {4}Amortisierte Analyse}{7}{section.4}}
    2.75 -\@writefile{toc}{\contentsline {subsection}{\numberline {4.1}Binomial Heaps}{7}{subsection.4.1}}
    2.76 -\@writefile{toc}{\contentsline {subsection}{\numberline {4.2}Fibonacci Heaps}{7}{subsection.4.2}}
    2.77 -\@writefile{toc}{\contentsline {subsection}{\numberline {4.3}Union Find}{7}{subsection.4.3}}
    2.78 -\BKM@entry{id=22,dest={73656374696F6E2E35}}{477265656479}
    2.79 -\BKM@entry{id=23,dest={73756273656374696F6E2E352E31}}{4B5C333734727A65737465205C2862696C6C69677374655C292057656765}
    2.80 -\@writefile{toc}{\contentsline {section}{\numberline {5}Greedy}{8}{section.5}}
    2.81 -\@writefile{toc}{\contentsline {subsection}{\numberline {5.1}K\"urzeste (billigste) Wege}{8}{subsection.5.1}}
    2.82 -\BKM@entry{id=24,dest={73656374696F6E2E36}}{42696E205061636B696E67}
    2.83 -\BKM@entry{id=25,dest={73756273656374696F6E2E362E31}}{4F6E6C696E652056657266616872656E}
    2.84 -\BKM@entry{id=26,dest={73756273756273656374696F6E2E362E312E31}}{4E65787420466974205C284E465C29}
    2.85 -\BKM@entry{id=27,dest={73756273756273656374696F6E2E362E312E32}}{46697273742D466974205C2846465C29}
    2.86 -\@writefile{toc}{\contentsline {section}{\numberline {6}Bin Packing}{9}{section.6}}
    2.87 -\@writefile{toc}{\contentsline {subsection}{\numberline {6.1}Online Verfahren}{9}{subsection.6.1}}
    2.88 -\@writefile{toc}{\contentsline {subsubsection}{\numberline {6.1.1}Next Fit (NF)}{9}{subsubsection.6.1.1}}
    2.89 -\@writefile{toc}{\contentsline {subsubsection}{\numberline {6.1.2}First-Fit (FF)}{9}{subsubsection.6.1.2}}
    2.90 -\BKM@entry{id=28,dest={73756273756273656374696F6E2E362E312E33}}{426573742D466974205C2842465C29}
    2.91 -\BKM@entry{id=29,dest={73756273656374696F6E2E362E32}}{4F66666C696E652056657266616872656E}
    2.92 -\BKM@entry{id=30,dest={73756273756273656374696F6E2E362E322E31}}{4669727374204669742044656372656173696E67205C28464644206F6465722046464E495C29}
    2.93 -\BKM@entry{id=31,dest={73756273756273656374696F6E2E362E322E32}}{42657374204669742044656372656173696E67205C284246445C29}
    2.94 -\@writefile{toc}{\contentsline {subsubsection}{\numberline {6.1.3}Best-Fit (BF)}{10}{subsubsection.6.1.3}}
    2.95 -\@writefile{toc}{\contentsline {subsection}{\numberline {6.2}Offline Verfahren}{10}{subsection.6.2}}
    2.96 -\@writefile{toc}{\contentsline {subsubsection}{\numberline {6.2.1}First Fit Decreasing (FFD oder FFNI)}{10}{subsubsection.6.2.1}}
    2.97 -\@writefile{toc}{\contentsline {subsubsection}{\numberline {6.2.2}Best Fit Decreasing (BFD)}{10}{subsubsection.6.2.2}}
    2.98 -\BKM@entry{id=32,dest={73656374696F6E2E37}}{44796E616D69736368652050726F6772616D6D696572756E67}
    2.99 -\@writefile{toc}{\contentsline {section}{\numberline {7}Dynamische Programmierung}{11}{section.7}}
   2.100 -\BKM@entry{id=33,dest={617070656E6469782E41}}{4C616E6461752D53796D626F6C65}
   2.101 -\@writefile{toc}{\contentsline {section}{\numberline {A}Landau-Symbole}{12}{appendix.A}}
   2.102 -\@writefile{lof}{\contentsline {figure}{\numberline {2}{\ignorespaces Definition der Landau Symbole}}{12}{figure.2}}
   2.103 -\newlabel{fig:landau_sym}{{2}{12}{Definition der Landau Symbole\relax }{figure.2}{}}
   2.104 -\newlabel{LastPage}{{}{12}{}{page.12}{}}
     3.1 --- a/exzerpt.bbl	Tue Feb 22 19:02:39 2011 +0100
     3.2 +++ /dev/null	Thu Jan 01 00:00:00 1970 +0000
     3.3 @@ -1,25 +0,0 @@
     3.4 -\begin{thebibliography}{THC01}
     3.5 -
     3.6 -% this bibliography is generated by alphadin.bst [8.2] from 2005-12-21
     3.7 -
     3.8 -\providecommand{\url}[1]{\texttt{#1}}
     3.9 -\expandafter\ifx\csname urlstyle\endcsname\relax
    3.10 -  \providecommand{\doi}[1]{doi: #1}\else
    3.11 -  \providecommand{\doi}{doi: \begingroup \urlstyle{rm}\Url}\fi
    3.12 -
    3.13 -\bibitem[PW02]{2}
    3.14 -\textsc{Peter~Widmayer}, Thomas~O.:
    3.15 -\newblock \emph{Algorithmen und Datenstrukturen}.
    3.16 -\newblock 4. Auflage.
    3.17 -\newblock Spektrum Akademischer Verlag, 2002. --
    3.18 -\newblock ISBN 978--3827410290
    3.19 -
    3.20 -\bibitem[THC01]{1}
    3.21 -\textsc{Thomas H.~Cormen}, Robert L. Rivest und Cliford~S. Charles
    3.22 -  E.~Leiserson~L. Charles E.~Leiserson:
    3.23 -\newblock \emph{Introduction to Algorithms}.
    3.24 -\newblock 2nd.
    3.25 -\newblock Prentice Hall India, 2001. --
    3.26 -\newblock ISBN 978--8120321410
    3.27 -
    3.28 -\end{thebibliography}
     4.1 --- a/exzerpt.blg	Tue Feb 22 19:02:39 2011 +0100
     4.2 +++ /dev/null	Thu Jan 01 00:00:00 1970 +0000
     4.3 @@ -1,3 +0,0 @@
     4.4 -This is BibTeX, Version 0.99cThe top-level auxiliary file: M:\Documents\004_Uni Freiburg\VLR\Semester_1\Algorithmentheorie\Exzerpt\exzerpt.aux
     4.5 -The style file: alphadin.bst
     4.6 -Database file #1: literatur.bib
     5.1 Binary file exzerpt.dvi has changed
     6.1 --- a/exzerpt.log	Tue Feb 22 19:02:39 2011 +0100
     6.2 +++ /dev/null	Thu Jan 01 00:00:00 1970 +0000
     6.3 @@ -1,693 +0,0 @@
     6.4 -This is pdfTeX, Version 3.1415926-1.40.10 (MiKTeX 2.8) (preloaded format=latex 2011.1.19)  31 JAN 2011 23:07
     6.5 -entering extended mode
     6.6 -**M:/Documents/004_Uni-Freiburg/VLR/Semester_1/Algorithmentheorie/Exzerpt/algor
     6.7 -ithms_theory/exzerpt.tex
     6.8 -
     6.9 -(M:/Documents/004_Uni-Freiburg/VLR/Semester_1/Algorithmentheorie/Exzerpt/algori
    6.10 -thms_theory/exzerpt.tex
    6.11 -LaTeX2e <2009/09/24>
    6.12 -Babel <v3.8l> and hyphenation patterns for english, dumylang, nohyphenation, ge
    6.13 -rman, ngerman, german-x-2009-06-19, ngerman-x-2009-06-19, french, loaded.
    6.14 -("C:\Program Files\MikTex\tex\latex\base\article.cls"
    6.15 -Document Class: article 2007/10/19 v1.4h Standard LaTeX document class
    6.16 -("C:\Program Files\MikTex\tex\latex\base\size11.clo"
    6.17 -File: size11.clo 2007/10/19 v1.4h Standard LaTeX file (size option)
    6.18 -)
    6.19 -\c@part=\count79
    6.20 -\c@section=\count80
    6.21 -\c@subsection=\count81
    6.22 -\c@subsubsection=\count82
    6.23 -\c@paragraph=\count83
    6.24 -\c@subparagraph=\count84
    6.25 -\c@figure=\count85
    6.26 -\c@table=\count86
    6.27 -\abovecaptionskip=\skip41
    6.28 -\belowcaptionskip=\skip42
    6.29 -\bibindent=\dimen102
    6.30 -)
    6.31 -("C:\Program Files\MikTex\tex\generic\babel\babel.sty"
    6.32 -Package: babel 2008/07/06 v3.8l The Babel package
    6.33 -
    6.34 -*************************************
    6.35 -* Local config file bblopts.cfg used
    6.36 -*
    6.37 -("C:\Program Files\MikTex\tex\latex\00miktex\bblopts.cfg"
    6.38 -File: bblopts.cfg 2006/07/31 v1.0 MiKTeX 'babel' configuration
    6.39 -)
    6.40 -("C:\Program Files\MikTex\tex\generic\babel\ngermanb.ldf"
    6.41 -Language: ngermanb 2008/07/06 v2.6n new German support from the babel system
    6.42 -
    6.43 -("C:\Program Files\MikTex\tex\generic\babel\babel.def"
    6.44 -File: babel.def 2008/07/06 v3.8l Babel common definitions
    6.45 -\babel@savecnt=\count87
    6.46 -\U@D=\dimen103
    6.47 -)
    6.48 -\l@naustrian = a dialect from \language\l@ngerman 
    6.49 -Package babel Info: Making " an active character on input line 92.
    6.50 -))
    6.51 -("C:\Program Files\MikTex\tex\latex\base\fontenc.sty"
    6.52 -Package: fontenc 2005/09/27 v1.99g Standard LaTeX package
    6.53 -
    6.54 -("C:\Program Files\MikTex\tex\latex\base\t1enc.def"
    6.55 -File: t1enc.def 2005/09/27 v1.99g Standard LaTeX file
    6.56 -LaTeX Font Info:    Redeclaring font encoding T1 on input line 43.
    6.57 -))
    6.58 -("C:\Program Files\MikTex\tex\latex\base\inputenc.sty"
    6.59 -Package: inputenc 2008/03/30 v1.1d Input encoding file
    6.60 -\inpenc@prehook=\toks14
    6.61 -\inpenc@posthook=\toks15
    6.62 -
    6.63 -("C:\Program Files\MikTex\tex\latex\base\latin1.def"
    6.64 -File: latin1.def 2008/03/30 v1.1d Input encoding file
    6.65 -))
    6.66 -("C:\Program Files\MikTex\tex\latex\hyperref\hyperref.sty"
    6.67 -Package: hyperref 2010/10/30 v6.81t Hypertext links for LaTeX
    6.68 -
    6.69 -("C:\Program Files\MikTex\tex\generic\oberdiek\ltxcmds.sty"
    6.70 -Package: ltxcmds 2010/04/26 v1.7 LaTeX kernel commands for general use (HO)
    6.71 -)
    6.72 -("C:\Program Files\MikTex\tex\generic\oberdiek\infwarerr.sty"
    6.73 -Package: infwarerr 2010/04/08 v1.3 Providing info/warning/message (HO)
    6.74 -)
    6.75 -("C:\Program Files\MikTex\tex\latex\graphics\keyval.sty"
    6.76 -Package: keyval 1999/03/16 v1.13 key=value parser (DPC)
    6.77 -\KV@toks@=\toks16
    6.78 -)
    6.79 -("C:\Program Files\MikTex\tex\generic\oberdiek\kvsetkeys.sty"
    6.80 -Package: kvsetkeys 2010/03/01 v1.9 Key value parser (HO)
    6.81 -
    6.82 -("C:\Program Files\MikTex\tex\generic\oberdiek\etexcmds.sty"
    6.83 -Package: etexcmds 2010/01/28 v1.3 Prefix for e-TeX command names (HO)
    6.84 -Package etexcmds Info: Could not find \expanded.
    6.85 -(etexcmds)             That can mean that you are not using pdfTeX 1.50 or
    6.86 -(etexcmds)             that some package has redefined \expanded.
    6.87 -(etexcmds)             In the latter case, load this package earlier.
    6.88 -))
    6.89 -("C:\Program Files\MikTex\tex\generic\oberdiek\pdfescape.sty"
    6.90 -Package: pdfescape 2010/03/01 v1.9 Provides hex, PDF name and string conversion
    6.91 -s (HO)
    6.92 -
    6.93 -("C:\Program Files\MikTex\tex\generic\oberdiek\pdftexcmds.sty"
    6.94 -Package: pdftexcmds 2010/04/01 v0.9 Utility functions of pdfTeX for LuaTeX (HO)
    6.95 -
    6.96 -
    6.97 -("C:\Program Files\MikTex\tex\generic\oberdiek\ifluatex.sty"
    6.98 -Package: ifluatex 2010/03/01 v1.3 Provides the ifluatex switch (HO)
    6.99 -Package ifluatex Info: LuaTeX not detected.
   6.100 -)
   6.101 -Package pdftexcmds Info: LuaTeX not detected.
   6.102 -Package pdftexcmds Info: \pdf@primitive is available.
   6.103 -Package pdftexcmds Info: \pdf@ifprimitive is available.
   6.104 -))
   6.105 -("C:\Program Files\MikTex\tex\generic\oberdiek\ifpdf.sty"
   6.106 -Package: ifpdf 2010/01/28 v2.1 Provides the ifpdf switch (HO)
   6.107 -Package ifpdf Info: pdfTeX in pdf mode not detected.
   6.108 -)
   6.109 -("C:\Program Files\MikTex\tex\generic\oberdiek\ifvtex.sty"
   6.110 -Package: ifvtex 2010/03/01 v1.5 Switches for detecting VTeX and its modes (HO)
   6.111 -Package ifvtex Info: VTeX not detected.
   6.112 -)
   6.113 -("C:\Program Files\MikTex\tex\generic\ifxetex\ifxetex.sty"
   6.114 -Package: ifxetex 2010/09/12 v0.6 Provides ifxetex conditional
   6.115 -)
   6.116 -("C:\Program Files\MikTex\tex\latex\oberdiek\hycolor.sty"
   6.117 -Package: hycolor 2009/12/12 v1.6 Color options of hyperref/bookmark (HO)
   6.118 -
   6.119 -("C:\Program Files\MikTex\tex\latex\oberdiek\xcolor-patch.sty"
   6.120 -Package: xcolor-patch 2009/12/12 xcolor patch
   6.121 -))
   6.122 -("C:\Program Files\MikTex\tex\latex\oberdiek\letltxmacro.sty"
   6.123 -Package: letltxmacro 2008/06/24 v1.3 Let assignment for LaTeX macros (HO)
   6.124 -)
   6.125 -("C:\Program Files\MikTex\tex\latex\oberdiek\kvoptions.sty"
   6.126 -Package: kvoptions 2010/02/22 v3.7 Keyval support for LaTeX options (HO)
   6.127 -)
   6.128 -\@linkdim=\dimen104
   6.129 -\Hy@linkcounter=\count88
   6.130 -\Hy@pagecounter=\count89
   6.131 -
   6.132 -("C:\Program Files\MikTex\tex\latex\hyperref\pd1enc.def"
   6.133 -File: pd1enc.def 2010/10/30 v6.81t Hyperref: PDFDocEncoding definition (HO)
   6.134 -)
   6.135 -("C:\Program Files\MikTex\tex\generic\oberdiek\intcalc.sty"
   6.136 -Package: intcalc 2007/09/27 v1.1 Expandable integer calculations (HO)
   6.137 -)
   6.138 -\Hy@SavedSpaceFactor=\count90
   6.139 -
   6.140 -("C:\Program Files\MikTex\tex\latex\00miktex\hyperref.cfg"
   6.141 -File: hyperref.cfg 2002/06/06 v1.2 hyperref configuration of TeXLive
   6.142 -)
   6.143 -Package hyperref Info: Option `colorlinks' set `true' on input line 3872.
   6.144 -Package hyperref Info: Hyper figures OFF on input line 3976.
   6.145 -Package hyperref Info: Link nesting OFF on input line 3981.
   6.146 -Package hyperref Info: Hyper index ON on input line 3984.
   6.147 -Package hyperref Info: Plain pages OFF on input line 3991.
   6.148 -Package hyperref Info: Backreferencing OFF on input line 3996.
   6.149 -Package hyperref Info: Implicit mode ON; LaTeX internals redefined.
   6.150 -Package hyperref Info: Bookmarks ON on input line 4211.
   6.151 -\c@Hy@tempcnt=\count91
   6.152 -
   6.153 -("C:\Program Files\MikTex\tex\latex\ltxmisc\url.sty"
   6.154 -\Urlmuskip=\muskip10
   6.155 -Package: url 2006/04/12  ver 3.3  Verb mode for urls, etc.
   6.156 -)
   6.157 -LaTeX Info: Redefining \url on input line 4566.
   6.158 -
   6.159 -("C:\Program Files\MikTex\tex\generic\oberdiek\bitset.sty"
   6.160 -Package: bitset 2007/09/28 v1.0 Data type bit set (HO)
   6.161 -
   6.162 -("C:\Program Files\MikTex\tex\generic\oberdiek\bigintcalc.sty"
   6.163 -Package: bigintcalc 2007/11/11 v1.1 Expandable big integer calculations (HO)
   6.164 -))
   6.165 -\Fld@menulength=\count92
   6.166 -\Field@Width=\dimen105
   6.167 -\Fld@charsize=\dimen106
   6.168 -Package hyperref Info: Hyper figures OFF on input line 5626.
   6.169 -Package hyperref Info: Link nesting OFF on input line 5631.
   6.170 -Package hyperref Info: Hyper index ON on input line 5634.
   6.171 -Package hyperref Info: backreferencing OFF on input line 5641.
   6.172 -Package hyperref Info: Link coloring ON on input line 5644.
   6.173 -Package hyperref Info: Link coloring with OCG OFF on input line 5651.
   6.174 -Package hyperref Info: PDF/A mode OFF on input line 5656.
   6.175 -LaTeX Info: Redefining \ref on input line 5696.
   6.176 -LaTeX Info: Redefining \pageref on input line 5700.
   6.177 -
   6.178 -("C:\Program Files\MikTex\tex\generic\oberdiek\atbegshi.sty"
   6.179 -Package: atbegshi 2010/03/25 v1.12 At begin shipout hook (HO)
   6.180 -)
   6.181 -\Hy@abspage=\count93
   6.182 -\c@Item=\count94
   6.183 -\c@Hfootnote=\count95
   6.184 -)
   6.185 -
   6.186 -Package hyperref Message: Driver (default): hdvips.
   6.187 -
   6.188 -("C:\Program Files\MikTex\tex\latex\hyperref\hdvips.def"
   6.189 -File: hdvips.def 2010/10/30 v6.81t Hyperref driver for dvips
   6.190 -
   6.191 -("C:\Program Files\MikTex\tex\latex\hyperref\pdfmark.def"
   6.192 -File: pdfmark.def 2010/10/30 v6.81t Hyperref definitions for pdfmark specials
   6.193 -\pdf@docset=\toks17
   6.194 -\pdf@box=\box26
   6.195 -\pdf@toks=\toks18
   6.196 -\pdf@defaulttoks=\toks19
   6.197 -\Fld@listcount=\count96
   6.198 -\c@bookmark@seq@number=\count97
   6.199 -
   6.200 -("C:\Program Files\MikTex\tex\latex\oberdiek\rerunfilecheck.sty"
   6.201 -Package: rerunfilecheck 2010/03/16 v1.6 Rerun checks for auxiliary files (HO)
   6.202 -
   6.203 -("C:\Program Files\MikTex\tex\latex\oberdiek\atveryend.sty"
   6.204 -Package: atveryend 2010/03/24 v1.5 Hooks at very end of document (HO)
   6.205 -Package atveryend Info: \enddocument detected (standard).
   6.206 -)
   6.207 -("C:\Program Files\MikTex\tex\generic\oberdiek\uniquecounter.sty"
   6.208 -Package: uniquecounter 2009/12/18 v1.1 Provides unlimited unique counter (HO)
   6.209 -)
   6.210 -Package uniquecounter Info: New unique counter `rerunfilecheck' on input line 2
   6.211 -71.
   6.212 -)
   6.213 -\Hy@SectionHShift=\skip43
   6.214 -))
   6.215 -("C:\Program Files\MikTex\tex\latex\vaucanson-g\vaucanson-g.sty"
   6.216 -Package: vaucanson-g 2008/10/27 package wrapper for VauCanSon-G v. 0.4
   6.217 -
   6.218 -("C:\Program Files\MikTex\tex\latex\base\ifthen.sty"
   6.219 -Package: ifthen 2001/05/26 v1.1c Standard LaTeX ifthen package (DPC)
   6.220 -)
   6.221 -("C:\Program Files\MikTex\tex\latex\xcolor\xcolor.sty"
   6.222 -Package: xcolor 2007/01/21 v2.11 LaTeX color extensions (UK)
   6.223 -
   6.224 -("C:\Program Files\MikTex\tex\latex\00miktex\color.cfg"
   6.225 -File: color.cfg 2007/01/18 v1.5 color configuration of teTeX/TeXLive
   6.226 -)
   6.227 -Package xcolor Info: Package option `pst' ignored on input line 216.
   6.228 -Package xcolor Info: Driver file: dvips.def on input line 225.
   6.229 -
   6.230 -("C:\Program Files\MikTex\tex\latex\graphics\dvips.def"
   6.231 -File: dvips.def 1999/02/16 v3.0i Driver-dependant file (DPC,SPQR)
   6.232 -)
   6.233 -Package xcolor Info: Model `cmy' substituted by `cmy0' on input line 1337.
   6.234 -Package xcolor Info: Model `RGB' extended on input line 1353.
   6.235 -Package xcolor Info: Model `HTML' substituted by `rgb' on input line 1355.
   6.236 -Package xcolor Info: Model `Hsb' substituted by `hsb' on input line 1356.
   6.237 -Package xcolor Info: Model `tHsb' substituted by `hsb' on input line 1357.
   6.238 -Package xcolor Info: Model `HSB' substituted by `hsb' on input line 1358.
   6.239 -Package xcolor Info: Model `Gray' substituted by `gray' on input line 1359.
   6.240 -Package xcolor Info: Model `wave' substituted by `hsb' on input line 1360.
   6.241 -)
   6.242 -("C:\Program Files\MikTex\tex\generic\vaucanson-g\VCColor-names.def")
   6.243 -("C:\Program Files\MikTex\tex\latex\pstricks\pstricks.sty"
   6.244 -Package: pstricks 2010/08/28 v0.46 LaTeX wrapper for `PSTricks' (RN,HV)
   6.245 -
   6.246 -("C:\Program Files\MikTex\tex\generic\pstricks\pstricks.tex"
   6.247 -("C:\Program Files\MikTex\tex\generic\xkeyval\pst-xkey.tex"
   6.248 -File: pst-xkey.tex 2005/11/25 v1.6 PSTricks specialization of xkeyval (HA)
   6.249 -
   6.250 -("C:\Program Files\MikTex\tex\latex\xkeyval\xkeyval.sty"
   6.251 -Package: xkeyval 2008/08/13 v2.6a package option processing (HA)
   6.252 -
   6.253 -("C:\Program Files\MikTex\tex\generic\xkeyval\xkeyval.tex"
   6.254 -\XKV@toks=\toks20
   6.255 -\XKV@tempa@toks=\toks21
   6.256 -\XKV@depth=\count98
   6.257 -File: xkeyval.tex 2008/08/13 v2.6a key=value parser (HA)
   6.258 -)))
   6.259 -("C:\Program Files\MikTex\tex\generic\pstricks\pst-fp.tex"
   6.260 -`pst-fp' v0.05, 2010/01/17 (hv)
   6.261 -\pstFP@xs=\count99
   6.262 -\pstFP@xia=\count100
   6.263 -\pstFP@xib=\count101
   6.264 -\pstFP@xfa=\count102
   6.265 -\pstFP@xfb=\count103
   6.266 -\pstFP@rega=\count104
   6.267 -\pstFP@regb=\count105
   6.268 -\pstFP@regs=\count106
   6.269 -\pstFP@times=\count107
   6.270 -)
   6.271 -\psLoopIndex=\count108
   6.272 -
   6.273 -`PSTricks' v2.12  <2010/09/16> (tvz)
   6.274 -\pst@dima=\dimen107
   6.275 -\pst@dimb=\dimen108
   6.276 -\pst@dimc=\dimen109
   6.277 -\pst@dimd=\dimen110
   6.278 -\pst@dimg=\dimen111
   6.279 -\pst@dimh=\dimen112
   6.280 -\pst@dimm=\dimen113
   6.281 -\pst@dimn=\dimen114
   6.282 -\pst@dimo=\dimen115
   6.283 -\pst@dimp=\dimen116
   6.284 -\pst@hbox=\box27
   6.285 -\pst@boxg=\box28
   6.286 -\pst@cnta=\count109
   6.287 -\pst@cntb=\count110
   6.288 -\pst@cntc=\count111
   6.289 -\pst@cntd=\count112
   6.290 -\pst@cntg=\count113
   6.291 -\pst@cnth=\count114
   6.292 -\pst@cntm=\count115
   6.293 -\pst@cntn=\count116
   6.294 -\pst@cnto=\count117
   6.295 -\pst@cntp=\count118
   6.296 -\@zero=\count119
   6.297 -\pst@toks=\toks22
   6.298 -("C:\Program Files\MikTex\tex\generic\pstricks\pstricks.con")
   6.299 -\psunit=\dimen117
   6.300 -\psxunit=\dimen118
   6.301 -\psyunit=\dimen119
   6.302 -\pslinewidth=\dimen120
   6.303 -\psk@startLW=\dimen121
   6.304 -\psk@endLW=\dimen122
   6.305 -\pst@customdefs=\toks23
   6.306 -\pslinearc=\dimen123
   6.307 -\pst@symbolStep=\dimen124
   6.308 -\pst@symbolWidth=\dimen125
   6.309 -\everypsbox=\toks24
   6.310 -\psframesep=\dimen126
   6.311 -\pslabelsep=\dimen127
   6.312 -\pst@shift=\dimen128
   6.313 -\theoverlaybox=\box29
   6.314 -)
   6.315 -File: pstricks.tex 2010/09/16 v2.12 `PSTricks' (tvz,hv)
   6.316 -
   6.317 -("C:\Program Files\MikTex\tex\generic\pstricks\pst-fp.tex")
   6.318 -File: pst-fp.tex 2010/09/16 v2.12 `PST-fp' (hv)
   6.319 -)
   6.320 -("C:\Program Files\MikTex\tex\latex\pst-node\pst-node.sty"
   6.321 -Package: pst-node 2010/04/22 package wrapper for pst-node.tex
   6.322 -
   6.323 -("C:\Program Files\MikTex\tex\generic\pst-node\pst-node.tex"
   6.324 - v1.13, 2010/06/06
   6.325 -\psrow=\count120
   6.326 -\pscol=\count121
   6.327 -\psmatrixcnt=\count122
   6.328 -\psrowsep=\skip44
   6.329 -\pscolsep=\skip45
   6.330 -\pst@args=\count123
   6.331 -\num@pts=\count124
   6.332 -\pst@argcnt=\count125
   6.333 -)
   6.334 -File: pst-node.tex 2010/06/06 1.13 `pst-node' (tvz)
   6.335 -) ("C:\Program Files\MikTex\tex\latex\pst-plot\pst-plot.sty"
   6.336 -Package: pst-plot 2010/01/22 package wrapper for pst-plot.tex
   6.337 -("C:\Program Files\MikTex\tex\generic\pst-plot\pst-plot.tex"
   6.338 -("C:\Program Files\MikTex\tex\generic\multido\multido.tex"
   6.339 - v1.42, 2010/05/14 <tvz>
   6.340 -\multido@count=\count126
   6.341 -\multidocount=\count127
   6.342 -\multido@stuff=\toks25
   6.343 -)  v1.21, 2010/09/28 (tvz,hv)
   6.344 -\pstRadUnit=\dimen129
   6.345 -\pstRadUnitInv=\dimen130
   6.346 -\pst@linecnt=\count128
   6.347 -\psk@subticksize=\dimen131
   6.348 -\pst@xticksizeA=\dimen132
   6.349 -\pst@xticksizeB=\dimen133
   6.350 -\pst@xticksizeC=\dimen134
   6.351 -\pst@yticksizeA=\dimen135
   6.352 -\pst@yticksizeB=\dimen136
   6.353 -\pst@yticksizeC=\dimen137
   6.354 -\@digitcounter=\count129
   6.355 -\psk@llx=\dimen138
   6.356 -\psk@lly=\dimen139
   6.357 -\psk@urx=\dimen140
   6.358 -\psk@ury=\dimen141
   6.359 -\pst@xunit=\dimen142
   6.360 -\pst@yunit=\dimen143
   6.361 -)
   6.362 -File: pst-plot.tex 2010/09/28 1.21 `pst-plot' (tvz,hv)
   6.363 -)
   6.364 -("C:\Program Files\MikTex\tex\latex\pst-coil\pst-coil.sty"
   6.365 -Package: pst-coil 2010/02/01 package wrapper for pst-coil.tex (hv)
   6.366 -
   6.367 -("C:\Program Files\MikTex\tex\generic\pst-coil\pst-coil.tex"
   6.368 - v1.21, 2010/09/28)
   6.369 -File: pst-coil.tex 2010/02/01 v1.03 `PST-coil' (tvz,hv)
   6.370 -) ("C:\Program Files\MikTex\tex\latex\multido\multido.sty"
   6.371 -Package: multido 2004/05/17 package wrapper for PSTricks `multido.tex', (HV/RN)
   6.372 -
   6.373 -)
   6.374 -("C:\Program Files\MikTex\tex\latex\pst-3d\pst-3d.sty"
   6.375 -Package: pst-3d 2009/07/28 package wrapper for pst-3d.tex (hv)
   6.376 -
   6.377 -("C:\Program Files\MikTex\tex\generic\pst-3d\pst-3d.tex"
   6.378 -`PST-3d' v1.11, 2010/02/14 (tvz))
   6.379 -File: pst-3d.tex 2010/02/14 v1.11 `PST-3d' (hv)
   6.380 -)
   6.381 -("C:\Program Files\MikTex\tex\latex\tools\calc.sty"
   6.382 -Package: calc 2007/08/22 v4.3 Infix arithmetic (KKT,FJ)
   6.383 -\calc@Acount=\count130
   6.384 -\calc@Bcount=\count131
   6.385 -\calc@Adimen=\dimen144
   6.386 -\calc@Bdimen=\dimen145
   6.387 -\calc@Askip=\skip46
   6.388 -\calc@Bskip=\skip47
   6.389 -LaTeX Info: Redefining \setlength on input line 76.
   6.390 -LaTeX Info: Redefining \addtolength on input line 77.
   6.391 -\calc@Ccount=\count132
   6.392 -\calc@Cskip=\skip48
   6.393 -)
   6.394 -("C:\Program Files\MikTex\tex\generic\vaucanson-g\Vaucanson-G.tex"
   6.395 -\MediumStateDiameter=\skip49
   6.396 -\SmallStateDiameter=\skip50
   6.397 -\LargeStateDiameter=\skip51
   6.398 -\VerySmallStateDiameter=\skip52
   6.399 -\StateLineWidth=\skip53
   6.400 -\EdgeLineWidth=\skip54
   6.401 -\EdgeArrowWidth=\skip55
   6.402 -\EdgeDblArrowWidth=\skip56
   6.403 -\ZZSize=\skip57
   6.404 -\EdgeOffset=\skip58
   6.405 -\EdgeNodeSep=\skip59
   6.406 -\VaucArcOffset=\skip60
   6.407 -\LoopOffset=\skip61
   6.408 -\LoopVarOffset=\skip62
   6.409 -\TransLabelSep=\skip63
   6.410 -\VertShiftH=\skip64
   6.411 -LaTeX Font Info:    External font `cmex10' loaded for size
   6.412 -(Font)              <10.95> on input line 206.
   6.413 -LaTeX Font Info:    External font `cmex10' loaded for size
   6.414 -(Font)              <8> on input line 206.
   6.415 -LaTeX Font Info:    External font `cmex10' loaded for size
   6.416 -(Font)              <6> on input line 206.
   6.417 -\VertShiftD=\skip65
   6.418 -\VertShift=\skip66
   6.419 -\StateLineWid=\skip67
   6.420 -\StateDiam=\skip68
   6.421 -\VaucAOS=\skip69
   6.422 -\VaucAOSdiag=\skip70
   6.423 -\VariableStateIntDiam=\skip71
   6.424 -\VariableStateWidth=\skip72
   6.425 -\VariableStateITPos=\skip73
   6.426 -\ExtraSpace=\skip74
   6.427 -\EdgeLineWid=\skip75
   6.428 -\EdgeArrowSZDim=\skip76
   6.429 -\EdgeLineBord=\skip77
   6.430 -\ZZSiZ=\skip78
   6.431 -\EdgeOff=\skip79
   6.432 -\VaucArcOff=\skip80
   6.433 -\LoopOff=\skip81
   6.434 -\LoopVarOff=\skip82
   6.435 -\EdgeNodeSP=\skip83
   6.436 -\TransLabelSP=\skip84
   6.437 -\c@anglea=\count133
   6.438 -\c@angleb=\count134
   6.439 -)
   6.440 -\VaucMinHeight=\skip85
   6.441 -\VaucMaxHeight=\skip86
   6.442 -
   6.443 -("C:\Program Files\MikTex\tex\generic\vaucanson-g\VCPref-default.tex"))
   6.444 -("C:\Program Files\MikTex\tex\latex\oberdiek\hypcap.sty"
   6.445 -Package: hypcap 2008/09/08 v1.10 Adjusting anchors of captions (HO)
   6.446 -)
   6.447 -("C:\Program Files\MikTex\tex\latex\fancyhdr\fancyhdr.sty"
   6.448 -\fancy@headwidth=\skip87
   6.449 -\f@ncyO@elh=\skip88
   6.450 -\f@ncyO@erh=\skip89
   6.451 -\f@ncyO@olh=\skip90
   6.452 -\f@ncyO@orh=\skip91
   6.453 -\f@ncyO@elf=\skip92
   6.454 -\f@ncyO@erf=\skip93
   6.455 -\f@ncyO@olf=\skip94
   6.456 -\f@ncyO@orf=\skip95
   6.457 -)
   6.458 -("C:\Program Files\MikTex\tex\latex\graphics\graphicx.sty"
   6.459 -Package: graphicx 1999/02/16 v1.0f Enhanced LaTeX Graphics (DPC,SPQR)
   6.460 -
   6.461 -("C:\Program Files\MikTex\tex\latex\graphics\graphics.sty"
   6.462 -Package: graphics 2009/02/05 v1.0o Standard LaTeX Graphics (DPC,SPQR)
   6.463 -
   6.464 -("C:\Program Files\MikTex\tex\latex\graphics\trig.sty"
   6.465 -Package: trig 1999/03/16 v1.09 sin cos tan (DPC)
   6.466 -)
   6.467 -("C:\Program Files\MikTex\tex\latex\00miktex\graphics.cfg"
   6.468 -File: graphics.cfg 2007/01/18 v1.5 graphics configuration of teTeX/TeXLive
   6.469 -)
   6.470 -Package graphics Info: Driver file: dvips.def on input line 91.
   6.471 -)
   6.472 -\Gin@req@height=\dimen146
   6.473 -\Gin@req@width=\dimen147
   6.474 -)
   6.475 -("C:\Program Files\MikTex\tex\latex\lastpage\lastpage.sty"
   6.476 -Package: lastpage 2010/09/24 v1.2f Refers to last page's name (HMM; JPG)
   6.477 -)
   6.478 -("C:\Program Files\MikTex\tex\latex\preprint\fullpage.sty"
   6.479 -Package: fullpage 1999/02/23 1.1 (PWD)
   6.480 -\FP@margin=\skip96
   6.481 -)
   6.482 -("C:\Program Files\MikTex\tex\latex\ams\classes\amsthm.sty"
   6.483 -Package: amsthm 2004/08/06 v2.20
   6.484 -\thm@style=\toks26
   6.485 -\thm@bodyfont=\toks27
   6.486 -\thm@headfont=\toks28
   6.487 -\thm@notefont=\toks29
   6.488 -\thm@headpunct=\toks30
   6.489 -\thm@preskip=\skip97
   6.490 -\thm@postskip=\skip98
   6.491 -\thm@headsep=\skip99
   6.492 -\dth@everypar=\toks31
   6.493 -)
   6.494 -("C:\Program Files\MikTex\tex\latex\ams\math\amsmath.sty"
   6.495 -Package: amsmath 2000/07/18 v2.13 AMS math features
   6.496 -\@mathmargin=\skip100
   6.497 -
   6.498 -For additional information on amsmath, use the `?' option.
   6.499 -("C:\Program Files\MikTex\tex\latex\ams\math\amstext.sty"
   6.500 -Package: amstext 2000/06/29 v2.01
   6.501 -
   6.502 -("C:\Program Files\MikTex\tex\latex\ams\math\amsgen.sty"
   6.503 -File: amsgen.sty 1999/11/30 v2.0
   6.504 -\@emptytoks=\toks32
   6.505 -\ex@=\dimen148
   6.506 -))
   6.507 -("C:\Program Files\MikTex\tex\latex\ams\math\amsbsy.sty"
   6.508 -Package: amsbsy 1999/11/29 v1.2d
   6.509 -\pmbraise@=\dimen149
   6.510 -)
   6.511 -("C:\Program Files\MikTex\tex\latex\ams\math\amsopn.sty"
   6.512 -Package: amsopn 1999/12/14 v2.01 operator names
   6.513 -)
   6.514 -\inf@bad=\count135
   6.515 -LaTeX Info: Redefining \frac on input line 211.
   6.516 -\uproot@=\count136
   6.517 -\leftroot@=\count137
   6.518 -LaTeX Info: Redefining \overline on input line 307.
   6.519 -\classnum@=\count138
   6.520 -\DOTSCASE@=\count139
   6.521 -LaTeX Info: Redefining \ldots on input line 379.
   6.522 -LaTeX Info: Redefining \dots on input line 382.
   6.523 -LaTeX Info: Redefining \cdots on input line 467.
   6.524 -\Mathstrutbox@=\box30
   6.525 -\strutbox@=\box31
   6.526 -\big@size=\dimen150
   6.527 -LaTeX Font Info:    Redeclaring font encoding OML on input line 567.
   6.528 -LaTeX Font Info:    Redeclaring font encoding OMS on input line 568.
   6.529 -\macc@depth=\count140
   6.530 -\c@MaxMatrixCols=\count141
   6.531 -\dotsspace@=\muskip11
   6.532 -\c@parentequation=\count142
   6.533 -\dspbrk@lvl=\count143
   6.534 -\tag@help=\toks33
   6.535 -\row@=\count144
   6.536 -\column@=\count145
   6.537 -\maxfields@=\count146
   6.538 -\andhelp@=\toks34
   6.539 -\eqnshift@=\dimen151
   6.540 -\alignsep@=\dimen152
   6.541 -\tagshift@=\dimen153
   6.542 -\tagwidth@=\dimen154
   6.543 -\totwidth@=\dimen155
   6.544 -\lineht@=\dimen156
   6.545 -\@envbody=\toks35
   6.546 -\multlinegap=\skip101
   6.547 -\multlinetaggap=\skip102
   6.548 -\mathdisplay@stack=\toks36
   6.549 -LaTeX Info: Redefining \[ on input line 2666.
   6.550 -LaTeX Info: Redefining \] on input line 2667.
   6.551 -)
   6.552 -("C:\Program Files\MikTex\tex\latex\amsfonts\amsfonts.sty"
   6.553 -Package: amsfonts 2009/06/22 v3.00 Basic AMSFonts support
   6.554 -\symAMSa=\mathgroup4
   6.555 -\symAMSb=\mathgroup5
   6.556 -LaTeX Font Info:    Overwriting math alphabet `\mathfrak' in version `bold'
   6.557 -(Font)                  U/euf/m/n --> U/euf/b/n on input line 96.
   6.558 -)
   6.559 -("C:\Program Files\MikTex\tex\latex\float\float.sty"
   6.560 -Package: float 2001/11/08 v1.3d Float enhancements (AL)
   6.561 -\c@float@type=\count147
   6.562 -\float@exts=\toks37
   6.563 -\float@box=\box32
   6.564 -\@float@everytoks=\toks38
   6.565 -\@floatcapt=\box33
   6.566 -)
   6.567 -("C:\Program Files\MikTex\tex\latex\paralist\paralist.sty"
   6.568 -Package: paralist 2002/03/18 v2.3b Extended list environments (BS)
   6.569 -\pltopsep=\skip103
   6.570 -\plpartopsep=\skip104
   6.571 -\plitemsep=\skip105
   6.572 -\plparsep=\skip106
   6.573 -\pl@lab=\toks39
   6.574 -)
   6.575 -("C:\Program Files\MikTex\tex\latex\listings\listings.sty"
   6.576 -\lst@mode=\count148
   6.577 -\lst@gtempboxa=\box34
   6.578 -\lst@token=\toks40
   6.579 -\lst@length=\count149
   6.580 -\lst@currlwidth=\dimen157
   6.581 -\lst@column=\count150
   6.582 -\lst@pos=\count151
   6.583 -\lst@lostspace=\dimen158
   6.584 -\lst@width=\dimen159
   6.585 -\lst@newlines=\count152
   6.586 -\lst@lineno=\count153
   6.587 -\lst@maxwidth=\dimen160
   6.588 -
   6.589 -("C:\Program Files\MikTex\tex\latex\listings\lstmisc.sty"
   6.590 -File: lstmisc.sty 2007/02/22 1.4 (Carsten Heinz)
   6.591 -\c@lstnumber=\count154
   6.592 -\lst@skipnumbers=\count155
   6.593 -\lst@framebox=\box35
   6.594 -)
   6.595 -("C:\Program Files\MikTex\tex\latex\listings\listings.cfg"
   6.596 -File: listings.cfg 2007/02/22 1.4 listings configuration
   6.597 -))
   6.598 -Package: listings 2007/02/22 1.4 (Carsten Heinz)
   6.599 -
   6.600 -("C:\Program Files\MikTex\tex\latex\oberdiek\bookmark.sty"
   6.601 -Package: bookmark 2010/04/08 v1.12 PDF bookmarks (HO)
   6.602 -
   6.603 -("C:\Program Files\MikTex\tex\latex\oberdiek\auxhook.sty"
   6.604 -Package: auxhook 2009/12/14 v1.2 Hooks for auxiliary files (HO)
   6.605 -)
   6.606 -("C:\Program Files\MikTex\tex\latex\oberdiek\bkm-dvips.def"
   6.607 -File: bkm-dvips.def 2010/04/08 v1.12 bookmark driver for dvips (HO)
   6.608 -\BKM@id=\count156
   6.609 -))
   6.610 -(M:\Documents\004_Uni-Freiburg\VLR\Semester_1\Algorithmentheorie\Exzerpt\algori
   6.611 -thms_theory\exzerpt.aux)
   6.612 -LaTeX Font Info:    Checking defaults for OML/cmm/m/it on input line 29.
   6.613 -LaTeX Font Info:    ... okay on input line 29.
   6.614 -LaTeX Font Info:    Checking defaults for T1/cmr/m/n on input line 29.
   6.615 -LaTeX Font Info:    ... okay on input line 29.
   6.616 -LaTeX Font Info:    Checking defaults for OT1/cmr/m/n on input line 29.
   6.617 -LaTeX Font Info:    ... okay on input line 29.
   6.618 -LaTeX Font Info:    Checking defaults for OMS/cmsy/m/n on input line 29.
   6.619 -LaTeX Font Info:    ... okay on input line 29.
   6.620 -LaTeX Font Info:    Checking defaults for OMX/cmex/m/n on input line 29.
   6.621 -LaTeX Font Info:    ... okay on input line 29.
   6.622 -LaTeX Font Info:    Checking defaults for U/cmr/m/n on input line 29.
   6.623 -LaTeX Font Info:    ... okay on input line 29.
   6.624 -LaTeX Font Info:    Checking defaults for PD1/pdf/m/n on input line 29.
   6.625 -LaTeX Font Info:    ... okay on input line 29.
   6.626 -\AtBeginShipoutBox=\box36
   6.627 -Package hyperref Info: Link coloring ON on input line 29.
   6.628 -
   6.629 -("C:\Program Files\MikTex\tex\latex\hyperref\nameref.sty"
   6.630 -Package: nameref 2010/04/30 v2.40 Cross-referencing by name of section
   6.631 -
   6.632 -("C:\Program Files\MikTex\tex\latex\oberdiek\refcount.sty"
   6.633 -Package: refcount 2008/08/11 v3.1 Data extraction from references (HO)
   6.634 -)
   6.635 -("C:\Program Files\MikTex\tex\generic\oberdiek\gettitlestring.sty"
   6.636 -Package: gettitlestring 2009/12/18 v1.3 Cleanup title references (HO)
   6.637 -)
   6.638 -\c@section@level=\count157
   6.639 -)
   6.640 -LaTeX Info: Redefining \ref on input line 29.
   6.641 -LaTeX Info: Redefining \pageref on input line 29.
   6.642 -LaTeX Info: Redefining \nameref on input line 29.
   6.643 -Package lastpage Info: Have a look at the pagesLTS package at
   6.644 -(lastpage)             http://www.ctan.org/tex-archive/ 
   6.645 -(lastpage)             macros/latex/contrib/pagesLTS/ 
   6.646 -(lastpage)             or
   6.647 -(lastpage)             http://www.ctan.org/tex-archive/ 
   6.648 -(lastpage)             install/macros/latex/contrib/pagesLTS.tds.zip
   6.649 -(lastpage)             ! on input line 29.
   6.650 -\c@lstlisting=\count158
   6.651 -LaTeX Font Info:    Try loading font information for U+msa on input line 31.
   6.652 -
   6.653 -("C:\Program Files\MikTex\tex\latex\amsfonts\umsa.fd"
   6.654 -File: umsa.fd 2009/06/22 v3.00 AMS symbols A
   6.655 -)
   6.656 -LaTeX Font Info:    Try loading font information for U+msb on input line 31.
   6.657 -
   6.658 -("C:\Program Files\MikTex\tex\latex\amsfonts\umsb.fd"
   6.659 -File: umsb.fd 2009/06/22 v3.00 AMS symbols B
   6.660 -)
   6.661 -(M:\Documents\004_Uni-Freiburg\VLR\Semester_1\Algorithmentheorie\Exzerpt\algori
   6.662 -thms_theory\exzerpt.toc)
   6.663 -\tf@toc=\write3
   6.664 - [1
   6.665 -
   6.666 -]
   6.667 -LaTeX Font Info:    Try loading font information for T1+cmtt on input line 37.
   6.668 - ("C:\Program Files\MikTex\tex\latex\base\t1cmtt.fd"
   6.669 -File: t1cmtt.fd 1999/05/25 v2.5h Standard LaTeX font definitions
   6.670 -)
   6.671 -(M:\Documents\004_Uni-Freiburg\VLR\Semester_1\Algorithmentheorie\Exzerpt\algori
   6.672 -thms_theory\exzerpt.bbl) [2] [3]
   6.673 -File: img/cl_pair.eps Graphic file (type eps)
   6.674 - <img/cl_pair.eps> [4] [5] [6] [7] [8] [9]
   6.675 -[10] [11]
   6.676 -File: img/landau_sym.eps Graphic file (type eps)
   6.677 - <img/landau_sym.eps> AED: lastpage setting LastPage 
   6.678 -[12]
   6.679 -Package atveryend Info: Empty hook `BeforeClearDocument' on input line 250.
   6.680 -Package atveryend Info: Executing hook `AfterLastShipout' on input line 250.
   6.681 -\BKM@file=\write4
   6.682 -
   6.683 -(M:\Documents\004_Uni-Freiburg\VLR\Semester_1\Algorithmentheorie\Exzerpt\algori
   6.684 -thms_theory\exzerpt.aux)
   6.685 -Package atveryend Info: Empty hook `AtVeryEndDocument' on input line 250.
   6.686 - ) 
   6.687 -Here is how much of TeX's memory you used:
   6.688 - 11535 strings out of 495270
   6.689 - 164528 string characters out of 3180477
   6.690 - 304233 words of memory out of 3000000
   6.691 - 14498 multiletter control sequences out of 15000+200000
   6.692 - 19725 words of font info for 55 fonts, out of 3000000 for 9000
   6.693 - 14 hyphenation exceptions out of 8191
   6.694 - 44i,9n,53p,1340b,398s stack positions out of 5000i,500n,10000p,200000b,50000s
   6.695 -
   6.696 -Output written on exzerpt.dvi (12 pages, 55792 bytes).
     7.1 --- a/exzerpt.out.ps	Tue Feb 22 19:02:39 2011 +0100
     7.2 +++ /dev/null	Thu Jan 01 00:00:00 1970 +0000
     7.3 @@ -1,147 +0,0 @@
     7.4 -%!
     7.5 -/pdfmark where{pop}
     7.6 -{/globaldict where{pop globaldict}{userdict}ifelse/pdfmark/cleartomark load put}
     7.7 -ifelse
     7.8 -[
     7.9 -/Title(Einleitung)
    7.10 -/Count -3
    7.11 -/Action/GoTo/Dest(section.1)cvn
    7.12 -/OUT pdfmark
    7.13 -[
    7.14 -/Title(Themen:)
    7.15 -/Action/GoTo/Dest(subsection.1.1)cvn
    7.16 -/OUT pdfmark
    7.17 -[
    7.18 -/Title(Problem-/Anwendungsbereiche:)
    7.19 -/Action/GoTo/Dest(subsection.1.2)cvn
    7.20 -/OUT pdfmark
    7.21 -[
    7.22 -/Title(Literatur:)
    7.23 -/Action/GoTo/Dest(subsection.1.3)cvn
    7.24 -/OUT pdfmark
    7.25 -[
    7.26 -/Title(Divide and Conquer)
    7.27 -/Count -5
    7.28 -/Action/GoTo/Dest(section.2)cvn
    7.29 -/OUT pdfmark
    7.30 -[
    7.31 -/Title(Formulierung des Divide and Conquer Prinzips)
    7.32 -/Action/GoTo/Dest(subsection.2.1)cvn
    7.33 -/OUT pdfmark
    7.34 -[
    7.35 -/Title(Quicksort)
    7.36 -/Count -1
    7.37 -/Action/GoTo/Dest(subsection.2.2)cvn
    7.38 -/OUT pdfmark
    7.39 -[
    7.40 -/Title(Analyse)
    7.41 -/Action/GoTo/Dest(subsubsection.2.2.1)cvn
    7.42 -/OUT pdfmark
    7.43 -[
    7.44 -/Title(N\344chste Paare)
    7.45 -/Count -2
    7.46 -/Action/GoTo/Dest(subsection.2.3)cvn
    7.47 -/OUT pdfmark
    7.48 -[
    7.49 -/Title(Algorithmus)
    7.50 -/Action/GoTo/Dest(subsubsection.2.3.1)cvn
    7.51 -/OUT pdfmark
    7.52 -[
    7.53 -/Title(Analyse)
    7.54 -/Action/GoTo/Dest(subsubsection.2.3.2)cvn
    7.55 -/OUT pdfmark
    7.56 -[
    7.57 -/Title(Segmentschnitt)
    7.58 -/Count -2
    7.59 -/Action/GoTo/Dest(subsection.2.4)cvn
    7.60 -/OUT pdfmark
    7.61 -[
    7.62 -/Title(Algorithmus)
    7.63 -/Action/GoTo/Dest(subsubsection.2.4.1)cvn
    7.64 -/OUT pdfmark
    7.65 -[
    7.66 -/Title(Analyse)
    7.67 -/Action/GoTo/Dest(subsubsection.2.4.2)cvn
    7.68 -/OUT pdfmark
    7.69 -[
    7.70 -/Title(Polynomprodukt und Fast Fourier-Transformation)
    7.71 -/Action/GoTo/Dest(subsection.2.5)cvn
    7.72 -/OUT pdfmark
    7.73 -[
    7.74 -/Title(Randomisierung)
    7.75 -/Count -1
    7.76 -/Action/GoTo/Dest(section.3)cvn
    7.77 -/OUT pdfmark
    7.78 -[
    7.79 -/Title(Hashing)
    7.80 -/Action/GoTo/Dest(subsection.3.1)cvn
    7.81 -/OUT pdfmark
    7.82 -[
    7.83 -/Title(Amortisierte Analyse)
    7.84 -/Count -3
    7.85 -/Action/GoTo/Dest(section.4)cvn
    7.86 -/OUT pdfmark
    7.87 -[
    7.88 -/Title(Binomial Heaps)
    7.89 -/Action/GoTo/Dest(subsection.4.1)cvn
    7.90 -/OUT pdfmark
    7.91 -[
    7.92 -/Title(Fibonacci Heaps)
    7.93 -/Action/GoTo/Dest(subsection.4.2)cvn
    7.94 -/OUT pdfmark
    7.95 -[
    7.96 -/Title(Union Find)
    7.97 -/Action/GoTo/Dest(subsection.4.3)cvn
    7.98 -/OUT pdfmark
    7.99 -[
   7.100 -/Title(Greedy)
   7.101 -/Count -1
   7.102 -/Action/GoTo/Dest(section.5)cvn
   7.103 -/OUT pdfmark
   7.104 -[
   7.105 -/Title(K\374rzeste \(billigste\) Wege)
   7.106 -/Action/GoTo/Dest(subsection.5.1)cvn
   7.107 -/OUT pdfmark
   7.108 -[
   7.109 -/Title(Bin Packing)
   7.110 -/Count -2
   7.111 -/Action/GoTo/Dest(section.6)cvn
   7.112 -/OUT pdfmark
   7.113 -[
   7.114 -/Title(Online Verfahren)
   7.115 -/Count -3
   7.116 -/Action/GoTo/Dest(subsection.6.1)cvn
   7.117 -/OUT pdfmark
   7.118 -[
   7.119 -/Title(Next Fit \(NF\))
   7.120 -/Action/GoTo/Dest(subsubsection.6.1.1)cvn
   7.121 -/OUT pdfmark
   7.122 -[
   7.123 -/Title(First-Fit \(FF\))
   7.124 -/Action/GoTo/Dest(subsubsection.6.1.2)cvn
   7.125 -/OUT pdfmark
   7.126 -[
   7.127 -/Title(Best-Fit \(BF\))
   7.128 -/Action/GoTo/Dest(subsubsection.6.1.3)cvn
   7.129 -/OUT pdfmark
   7.130 -[
   7.131 -/Title(Offline Verfahren)
   7.132 -/Count -2
   7.133 -/Action/GoTo/Dest(subsection.6.2)cvn
   7.134 -/OUT pdfmark
   7.135 -[
   7.136 -/Title(First Fit Decreasing \(FFD oder FFNI\))
   7.137 -/Action/GoTo/Dest(subsubsection.6.2.1)cvn
   7.138 -/OUT pdfmark
   7.139 -[
   7.140 -/Title(Best Fit Decreasing \(BFD\))
   7.141 -/Action/GoTo/Dest(subsubsection.6.2.2)cvn
   7.142 -/OUT pdfmark
   7.143 -[
   7.144 -/Title(Dynamische Programmierung)
   7.145 -/Action/GoTo/Dest(section.7)cvn
   7.146 -/OUT pdfmark
   7.147 -[
   7.148 -/Title(Landau-Symbole)
   7.149 -/Action/GoTo/Dest(appendix.A)cvn
   7.150 -/OUT pdfmark
     8.1 --- a/exzerpt.tex	Tue Feb 22 19:02:39 2011 +0100
     8.2 +++ /dev/null	Thu Jan 01 00:00:00 1970 +0000
     8.3 @@ -1,255 +0,0 @@
     8.4 -\documentclass[a4paper,11pt,twoside]{article}
     8.5 -
     8.6 -\usepackage[ngerman]{babel}
     8.7 -\usepackage[T1]{fontenc}
     8.8 -\usepackage[latin1]{inputenc}
     8.9 -\usepackage[colorlinks=true,linkcolor=black]{hyperref}
    8.10 -
    8.11 -\usepackage{vaucanson-g}
    8.12 -\usepackage{hyperref}
    8.13 -\usepackage{hypcap}
    8.14 -\usepackage{fancyhdr}
    8.15 -\usepackage{graphicx}
    8.16 -\usepackage{lastpage}
    8.17 -\usepackage[cm]{fullpage}
    8.18 -\usepackage{amsthm, amsmath, amsfonts}
    8.19 -\usepackage{float}
    8.20 -\usepackage{paralist}
    8.21 -\usepackage{listings}
    8.22 -\usepackage{color}
    8.23 -\usepackage{bookmark}
    8.24 -
    8.25 -% Festlegung Art der Zitierung - Havardmethode: Abkuerzung Autor + Jahr
    8.26 -\bibliographystyle{alphadin}
    8.27 -
    8.28 -\title{\underline{Exzerpt Algorithmentheorie WS10/11}}
    8.29 -\author{Markus Lindenmann}
    8.30 -\date{\today{} }
    8.31 -
    8.32 -\begin{document}
    8.33 -    \maketitle
    8.34 -    
    8.35 -    \tableofcontents
    8.36 -    \newpage
    8.37 -
    8.38 -    \section{Einleitung}\label{sec:intro}
    8.39 -        Dozent:     Matthias Westermann\\
    8.40 -        Website:    \url{http://lak.informatik.uni-freiburg.de}\\
    8.41 -        Klausur:    09.03.2011\\
    8.42 -        Hilfsmittel:    Ein auf beiden Seiten handbeschriebenes DIN-A4-Blatt
    8.43 -        \subsection{Themen:}
    8.44 -            \begin{itemize}
    8.45 -                \item[$\bullet$] Divide and Conquer
    8.46 -                \item[$\bullet$] Greedy Prinzip
    8.47 -                \item[$\bullet$] Dynamische Programmierung
    8.48 -                \item[$\bullet$] Randomisierung
    8.49 -                \item[$\bullet$] Amortisierte Analyse
    8.50 -            \end{itemize}
    8.51 -        \subsection{Problem-/Anwendungsbereiche:}
    8.52 -            \begin{itemize}
    8.53 -                \item[$\bullet$] Geometrische Algorithmen
    8.54 -                \item[$\bullet$] Algebraische Algorithmen
    8.55 -                \item[$\bullet$] Graphenalgorithmen
    8.56 -                \item[$\bullet$] Datenstrukturen
    8.57 -                \item[$\bullet$] Internet-Algorithmen
    8.58 -                \item[$\bullet$] ptimierungs-Verfahren
    8.59 -                \item[$\bullet$] Zeichenkettenverarbeitung
    8.60 -            \end{itemize}
    8.61 -        \subsection{Literatur:}
    8.62 -            \bibliography{literatur}
    8.63 -            \nocite{*}
    8.64 -    
    8.65 -    \newpage
    8.66 -    \section{Divide and Conquer}\label{sec:div&conq}
    8.67 -        \begin{itemize}
    8.68 -            \item[$\bullet$] Quicksort
    8.69 -            \item[$\bullet$] Formulierung und Analyse des Prinzips
    8.70 -            \item[$\bullet$] Geometrisches Devide and Conquer
    8.71 -            \begin{itemize}
    8.72 -                \item[-] Closest-Pair
    8.73 -                \item[-] Segmentschnitt
    8.74 -            \end{itemize}
    8.75 -        \end{itemize}
    8.76 -        
    8.77 -        \subsection{Formulierung des Divide and Conquer Prinzips}
    8.78 -            D\&C Verfahren zur Lösung eines Problems der Größe $n$
    8.79 -            \begin{itemize}
    8.80 -                \item[1.]   Divide\\$n>2$:  Teile das Problem in $k$ Teilprobleme der Größe $n_1,\ldots n_k$ ($k\geq2$)\\$n\leq c:$ Löse das Problem direkt
    8.81 -                \item[2.]   Conquer\\Löse die $k$ Teilprobleme auf dieselbe Art (rekursiv)
    8.82 -                \item[3.]   Merge\\Füge die berechneten Teillösungen zu einer Gesamtlösung zusammen
    8.83 -            \end{itemize}
    8.84 -        
    8.85 -        \subsection{Quicksort}
    8.86 -            Wähle beliebiges Pivot Element $v$ und sortiere alle Elemente aus der Menge, die größer sind als $v$ rechts von $v$ ein, die anderen links. Verfahre im selben Muster mit den neuen Teilmengen links und rechts des Pivot Elements. Wenn die zu sortierende Folge $F$ nur ein Element beinhaltet, gebe $F$ zurück.
    8.87 -			
    8.88 -            \subsubsection{Analyse}
    8.89 -                $T(n)$ - maximale Anzahl von Schritten, um ein Problem der Größe $n$ zu lösen.
    8.90 -                \[T(n)=\begin{cases}n\neq c&a \\ n>c&T(n_1+\ldots+T(n_k)+\text{Divide- und Mergeaufwand}\end{cases}\]
    8.91 -                Best Case: $k=2, n_1=n_2=\frac{n}{2}$\\
    8.92 -                Divide- und Mergeaufwand: $DM(n)$\\
    8.93 -                $T(1)=a$\\
    8.94 -                $T(n)=2T(\frac{n}{2})+DM(n)$
    8.95 -        
    8.96 -        \subsection{Nächste Paare}
    8.97 -            Eingabe:    $n$ Punkte in Ebene\\
    8.98 -            Ausgabe:    Punkt-Paar $q,r$ mit geringstem Abstand\\
    8.99 -            Abstand:    $d(q,r)$ bechreibt Abstand zwischen Punkten $q$ und $r$
   8.100 -            \subsubsection{Algorithmus}
   8.101 -                \begin{itemize}
   8.102 -                    \item[$\bullet$] sortiere Punktmenge nach x-Koordinate
   8.103 -                    \item[$\bullet$] Teile Punktmenge in der Mitte L in die Mengen Q und R
   8.104 -                    \item[$\bullet$] Löse rekursiv auf Q und R
   8.105 -                    \item[$\bullet$] Sortiere Punkte nach y-Koordinate
   8.106 -                    \item[$\bullet$] Teste alle Paare, deren Abstand in der Sortierung kleiner als 16 ist (siehe unten)
   8.107 -                    \item[$\bullet$] Füge zusammen
   8.108 -                \end{itemize}
   8.109 -            
   8.110 -                $\delta=$ Minimum der Teillösungen\\
   8.111 -                Gibt es $q\in Q$ und $r\in R$ mit $d(q,r)<\delta$, dann sind sowohl $q$ als auch $r$ höchstens $\delta$ von $L$ (Mitte) entfernt.\\
   8.112 -                \textbf{Problem:} alle Punkte können innerhalb der $\delta$-Zone liegen\\
   8.113 -                \textbf{Lösung:}\begin{itemize}
   8.114 -                    \item[$\bullet$] Sortiere Punkte in $\delta$ Zone nach $y$-Abstand
   8.115 -                    \item[$\bullet$] Liegen in dieser Sortierung mehr als $c$ Punkte zwischen $q$ und $r$, dann kann $(q,r)$ nicht nächstes Paar sein
   8.116 -                \end{itemize}
   8.117 -                
   8.118 -                Dies kann für $c=15$ bewiesen werden (vgl. Abbildung \ref{cl_pair}):
   8.119 -                \begin{itemize}
   8.120 -                    \item[$\bullet$] Seien min. 15 Punkte zwischen $q$ und $r$
   8.121 -                    \item[$\bullet$] Dann sind mindestens 3 Reihen Quadrate zwischen $q,r$, weil in jedem Quadrat höchstens ein Punkt ist.
   8.122 -                    \item[$\rightarrow$] Dann muss $d(q,r)$ mindestens $\frac{3}{2}\delta > \delta$ sein.
   8.123 -                \end{itemize}
   8.124 -                
   8.125 -                \begin{figure}[H]
   8.126 -                    \centering
   8.127 -                    \includegraphics[scale=0.5]{img/cl_pair}
   8.128 -                    \caption{Nächste Paare: Prüf Distanz}
   8.129 -                    \label{cl_pair}
   8.130 -                \end{figure}
   8.131 -
   8.132 -            \subsubsection{Analyse}
   8.133 -                \[T(n)=\begin{cases}n\leq3&a \\ n>3&2T(\frac{n}{2})+an\end{cases}\]
   8.134 -                \[T(n)\leq an \log n \]
   8.135 -
   8.136 -        \subsection{Segmentschnitt}
   8.137 -            Eingabe:    Menge S bestehend aus vertikalen Segmenten und Endpunkten vn horizontalen Segmenten\\
   8.138 -            Ausgabe:    Alle Schnittpunkte von vertikalen Segmenten mit horizontalen Segmenten, von denen mindesens ein Endpunkt in S ist
   8.139 -            
   8.140 -            \subsubsection{Algorithmus}
   8.141 -                \textbf{Divide \& Conquer:}\\Fallunterscheidung
   8.142 -                \begin{itemize}
   8.143 -                    \item[1.] $\left| S\right| > 1$:\\ Teile S mittels einer vertikalen Gerade G in 2 gleichgroße Mengen $S_1$ (links von G) und $S_2$ (rechts von G). Führe rekursiv auf beiden Hälften aus.
   8.144 -                    \item[2.] else: S enthält keine Schnitte
   8.145 -                \end{itemize}
   8.146 -                
   8.147 -                \textbf{Merge}\\
   8.148 -                Bilde L(S), R(S) und V(S) (Definition am Beispiel $i=1,2$ berechnet: $S=S_1\cup S_2$):
   8.149 -                \begin{itemize}
   8.150 -                    \item[$\bullet$] L(S): y-Koordinate aller linken Endpunkte in S, deren rechter Partner nicht in S\\$=L(S_2)\cup(L(S_1)-R(S_2))$
   8.151 -                    \item[$\bullet$] R(S): y-Koordinate aller rechten Endpunkte in S, deren linker Partner nicht in S\\$=R(S_1)\cup(R(S_2)-L(S_1))$
   8.152 -                    \item[$\bullet$] V(S): y-Intervalle der vertikalen Segmente in S\\$=V(S_1)\cup V(S_2)$
   8.153 -                \end{itemize}
   8.154 -                L,R sortiert nach steigender y-Koordinate\\
   8.155 -                V sortiert nach steigendem unteren Endpunkt\\
   8.156 -                \medskip
   8.157 -                
   8.158 -                \textbf{Basisfälle}\\
   8.159 -                S enthält nur ein Element s. Fallunterscheidung:
   8.160 -                \begin{itemize}
   8.161 -                    \item[1.] $s=(x,y)$ ist ein linker Endpunkt:\\$L(S)=\{y\},\qquad R(S)=\emptyset,\qquad V(S)=\emptyset$
   8.162 -                    \item[2.] $s=(x,y)$ ist ein rechter Endpunkt:\\$L(S)=\emptyset,\qquad R(S)=\{y\},\qquad V(S)=\emptyset$
   8.163 -                    \item[3.] $s=(x,y_1,y_2)$ ist ein vertikales Segment:\\$L(S)=\emptyset,\qquad R(S)=\emptyset,\qquad V(S)=\{[y_1,y_2]\}$
   8.164 -                \end{itemize}
   8.165 -            
   8.166 -            \subsubsection{Analyse}
   8.167 -                Eingabe wird Anfangs sortiert und in Array gespeichert
   8.168 -                \[T(n)=2T(\frac{n}{2}+an+\text{Größe der Ausgabe}\]
   8.169 -                \[T(1)=O(1)\]
   8.170 -                \[O(n \log n + k \mid k=\#Schnittpunkte\]
   8.171 -        
   8.172 -        \subsection{Polynomprodukt und Fast Fourier-Transformation}
   8.173 -            
   8.174 -            
   8.175 -	  \newpage
   8.176 -    \section{Randomisierung}
   8.177 -        \subsection{Hashing}
   8.178 -    
   8.179 -    \newpage
   8.180 -    \section{Amortisierte Analyse}
   8.181 -        \subsection{Binomial Heaps}
   8.182 -        \subsection{Fibonacci Heaps}
   8.183 -        \subsection{Union Find}
   8.184 -    
   8.185 -    \newpage
   8.186 -    \section{Greedy}
   8.187 -        \subsection{Kürzeste (billigste) Wege}
   8.188 -    
   8.189 -    \newpage
   8.190 -    \section{Bin Packing}
   8.191 -        \textbf{Problembeschreibung:}\\
   8.192 -        Man hat $n$ Objekte verschiedener Größe mit $0<s_i\leq1\mid 1\leq i\leq n$. Gesucht ist die kleinst mögliche Anzahl an Kisten (Bins) der Größe 1, mit der alle Objekte verpackt werden können.
   8.193 -        \subsection{Online Verfahren}
   8.194 -            Jedes (ankommende) Objekt muss verpackt sein, bevor das nächste Objekt betrachtet wird. Ein Objekt verbleibt in derjenigen Kiste, in die es zuerst gepackt wird.\\
   8.195 -            Kein Online Bin Packing Verfahren kann stets eine optimale Lösung finden!\\            
   8.196 -            \textbf{Satz 1}: Es gibt Eingaben, die jeden Online Bin Packing Algorithmus zwingen, wenigstens $\frac{4}{3} OPT$ Bins zu verwenden, wobei $OPT$ die minimal mögliche Binzahl ist.\\
   8.197 -            \textbf{Beweis} Annahme: Online Bin Packing Algorithmus benötigt stets weniger als $\frac{4}{3}OPT$ Bins.\\
   8.198 -            Es wird eine Eingabe mit $2m$ Objekten angenommen. Die ersten $m$ sind um $\epsilon$ kleiner als $\frac{1}{2}$, die zweiten $m$ um $\epsilon$ größer. Die optimale Lösung sind $m$ Kisten, da immer ein großes mit einem kleinen Paket kombiniert werden kann. Nun teilt man die Analyse in zwei Zeitpunkte: nach $m$ Objekten und nach $2m$ Objekten. Laut Annahme gilt nach nach $m$ Objekten, dass die Anzahl der Bins $b$ nur maximal $\frac{4}{3} OPT$ groß sein darf. Mit $OPT=\frac{m}{2}$ gilt somit: $b=\frac{4}{3}\cdot\frac{m}{2}=\frac{2}{3}m$. Sei $b=b_1+b_2\mid b_1=\#$Bins mit einem Objekt, $b_2=\#$Bins mit zwei Objekten, so folgt $b_1+2b_2=m\implies b_1=m-2b_2\implies b=b_1+b_2=m-b_2$. Nach $2m$ Objekten ist $OPT=m$, wie zuvor beschrieben. $b_1$ Bins können zu diesem Zeitpunkt mit Objekten des zweiten Bereichs gefüllt werden, für die verbleibenden muss man neue Bins öffnen. Die Anzahl der neu zu öffnenden beträgt damit genau $b_2\implies \#$Bins $\geq b+m-b_1=m+b_2$. Die Annahme besagt $m+b_2\leq\#$Bins $<\frac{4}{3}m \wedge b_2<\frac{m}{3}$. Dies ist nur möglich, wenn $b=m-b_2>\frac{2}{3}m$ - Dies führt zu einem \underline{Widerspruch}, da $b$ zum Zeitpunkt 1, nach $m$ Objekten $<\frac{2}{3}m$ sein muss.
   8.199 -            
   8.200 -            \subsubsection{Next Fit (NF)}
   8.201 -                Verpacke das nächste Objekt in dieselbe Kiste wie das vorherige, wenn es dort noch hineinpasst, sonst öffne eine neue Kiste und verpacke es dort.\\
   8.202 -                \textbf{Satz 2}: (a) Für alle Inputfolgen $I$ gilt: $NF(I)\leq2OPT(I)$. (b) Es gibt Inputfolgen I mit $NF(I)\geq2OPT(I)-2$.\\
   8.203 -                \textbf{Beweis}\\
   8.204 -                (a) Betrachte zwei beliebige aufeinanderfolgende Kisten $B_{2k-1}, B_{2k}$. Man weiß, dass die beinhalteten Objekte eine Summengröße $>1$ haben, sonst wären selbige in einer Kiste. Daraus folgt, man kann nicht mehr als die doppelte Anzahl an Kisten als beim Optimum erreichen!\\
   8.205 -                (b) Inputfolge: $0.5, \frac{2}{n}, 0.5, \frac{2}{n}, 0.5, \frac{2}{n}, \ldots 0.5, \frac{2}{n}$.\\Next-Fit liefert nun immer Bins gefüllt mit $0.5 + \frac{2}{n}$. Darausfolgt $NF(I)=\frac{n}{2}$ und $OPT=\frac{n}{4}+1$ (weil $\frac{n}{2}$ mal 0.5er Objekte in $=\frac{n}{4}$ Kisten passen und $\frac{n}{2}$ $\frac{2}{n}$er Objekte in eine Kiste passen)\\
   8.206 -                Laufzeit für Inputfolgen der Länge $n$: NF $O(n)$
   8.207 -            \subsubsection{First-Fit (FF)}
   8.208 -                Packe nächstes Objekt in die erste Kiste, in die es noch hineinpasst, wenn es eine solche Kiste gibt, sonst in eine neue Kiste.\\
   8.209 -                \textbf{Beobachtung}: Zu jedem Zeitpunkt kann es höchstens eine Kiste geben, die weniger als halb voll ist. ($\implies FF(I) \leq 2OPT(I)$)\\
   8.210 -                \textbf{Satz 3}: (a) Für alle Inputfolgen $I$ gilt $FF(I)\leq \lceil\frac{17}{10} OPT(I)\rceil$. (b) Es gibt Inputfolgen $I$ mit $FF(I)\geq\frac{17}{10}(OPT(I)-1)$. (b') Es gibt Inputfolgen $I$ mit $FF(I)=\frac{10}{6}OPT(I)$.\\
   8.211 -                \textbf{Beweis}\\
   8.212 -                (b') Inputfolge der Länge $3\cdot6m$. Dabei je $6m$ Objekte der Größen $\frac{1}{7}+\epsilon, \frac{1}{3}+\epsilon, \frac{1}{2}+\epsilon$, welche in gegebener Reihenfolge in Gruppen eingegeben werden. FF liefert hierbei $m$ Kisten gefüllt mit den Objekten der Größe $\frac{1}{7}+\epsilon$ (jeweils 6 pro Kiste) gefolgt von $\frac{6m}{2}=3m$ Kisten gefüllt mit Objekten der Größe $\frac{1}{3}+\epsilon$ (jeweils 2 pro Kiste) und schlussendlich $6m$ Kisten mit je einem Objekt der Größe $\frac{1}{2}+\epsilon$. Das macht in der Summe $10m$ Kisten. Die optimale Lösung packt je ein Objekt jeder Größe in eine Kiste und benötigt somit nur $6m$ Kisten.\\
   8.213 -                Laufzeit für Inputfolgen der Länge $n$: FF $O(n^2) \rightarrow O(n \log n)$
   8.214 -            \subsubsection{Best-Fit (BF)}
   8.215 -                Verpacke das nächste Objekt in diejenige Kiste, in die es am besten passt (d.h. den geringsten Platz ungenutzt lässt).
   8.216 -                Verhalten von BF ähnlich zu FF.
   8.217 -                Laufzeit für Inputfolgen der Länge $n$: BF $O(n^2) \rightarrow O(n \log n)$
   8.218 -        \subsection{Offline Verfahren}
   8.219 -            \underline{NP-schwieriges Problem! Entscheidungsproblem ist NP-vollständig!}\\
   8.220 -            Zunächst wird die Anzahl $n$ und alle $n$ Objekte vorgegeben. Dann beginnt die Verpackung.\\
   8.221 -            $n$ und $s_1, ..., s_n$ sind gegeben, bevor die Verpackung beginnt!\\
   8.222 -            $\rightarrow$ \underline{Optimale Verpackung} kann durch erschöpfende Suche bestimmt werden. ABER: Benötigt exponentielle Zeit! Daher Approximimationsalgorithmen, die schneller sind aber dafür unter Umständen nicht optimal!\\
   8.223 -            Idee für Offline Approximationsalgorithmen: Sortiere die Objekte zunächst nach abnhemender Größe und verpacke größere Objekte zuerst!
   8.224 -            \subsubsection{First Fit Decreasing (FFD oder FFNI)}
   8.225 -                \textbf{Lemma 1}: Sei $I$ eine Folge von $n$ Objekten mit Größen $s_1\geq s_2\geq\ldots\geq s_n$ und sei $m=OPT(I)$. Dann haben alle von FFD in den Bins $B_{m+1},B_{m+2},\ldots,B_{FFD(I)}$ verpackten Objekte eine Größe von höchstens $\frac{1}{3}$.\\
   8.226 -                \textbf{Beweis}: \$\$\$TODO:Elsässer hat das in seiner VL gemacht - aber hässlich lang\$\$\$\\
   8.227 -                \textbf{Lemma 2}: Sei $I$ eine Folge von $n$ Objekten mit Größen $s_1\geq s_2\geq\ldots\geq s_n$ und sei $m=OPT(I)$. Dann ist die Anzahl der Objekte, die FFD in die Kisten $B_{m+1},B_{m+2},\ldots,B_{FFD(I)}$ verpackt, höchstens $m-1$.\\
   8.228 -                \textbf{Beweis}: Annahme: Es gibt mehr als $m-1$ Objekte. $x_1,\ldots,x_m$ in $I$, die FFD in extra Kisten verpacken. Dies führt zu einem Widerspruch. \$\$\$TODO:Warum?\$\$\$\\
   8.229 -                \textbf{Satz}: Für alle Inputfolgen I gilt $FFD(I)\leq(4 OPT(I)+\frac{1}{3})$.\\
   8.230 -                \textbf{Satz}:
   8.231 -                \begin{itemize}
   8.232 -                    \item[1.] Für alle Inputfolgen $I$ gilt: $FFD(I)\leq \frac{11}{9} OPT(I)+4$
   8.233 -                    \item[2.] Es gibt Inputfolgen $I$ mit: $FFD(I)=\frac{11}{9}OPT(I)$.
   8.234 -                \end{itemize}
   8.235 -                \textbf{Beweis}: \$\$\$TODO\$\$\$
   8.236 -            \subsubsection{Best Fit Decreasing (BFD)}
   8.237 -                Nicht im Script???
   8.238 -    
   8.239 -    \newpage
   8.240 -    \section{Dynamische Programmierung}
   8.241 -		\subsection{Matrixkettenprodukt}
   8.242 -		\subsection{Optimale Suchbäume}
   8.243 -		\subsection{Editierdistanz}
   8.244 -	
   8.245 -	\section{Suche in Texten}
   8.246 -        
   8.247 -        
   8.248 -    \newpage
   8.249 -    \begin{appendix}
   8.250 -        \section{Landau-Symbole}
   8.251 -            \begin{figure}[H]
   8.252 -                \centering
   8.253 -                \includegraphics[scale=0.45]{img/landau_sym}
   8.254 -                \caption{Definition der Landau Symbole}
   8.255 -                \label{fig:landau_sym}
   8.256 -            \end{figure}
   8.257 -    \end{appendix}
   8.258 -\end{document}
   8.259 \ No newline at end of file
     9.1 --- a/exzerpt.toc	Tue Feb 22 19:02:39 2011 +0100
     9.2 +++ /dev/null	Thu Jan 01 00:00:00 1970 +0000
     9.3 @@ -1,34 +0,0 @@
     9.4 -\select@language {ngerman}
     9.5 -\contentsline {section}{\numberline {1}Einleitung}{2}{section.1}
     9.6 -\contentsline {subsection}{\numberline {1.1}Themen:}{2}{subsection.1.1}
     9.7 -\contentsline {subsection}{\numberline {1.2}Problem-/Anwendungsbereiche:}{2}{subsection.1.2}
     9.8 -\contentsline {subsection}{\numberline {1.3}Literatur:}{2}{subsection.1.3}
     9.9 -\contentsline {section}{\numberline {2}Divide and Conquer}{3}{section.2}
    9.10 -\contentsline {subsection}{\numberline {2.1}Formulierung des Divide and Conquer Prinzips}{3}{subsection.2.1}
    9.11 -\contentsline {subsection}{\numberline {2.2}Quicksort}{3}{subsection.2.2}
    9.12 -\contentsline {subsubsection}{\numberline {2.2.1}Analyse}{3}{subsubsection.2.2.1}
    9.13 -\contentsline {subsection}{\numberline {2.3}N\"achste Paare}{3}{subsection.2.3}
    9.14 -\contentsline {subsubsection}{\numberline {2.3.1}Algorithmus}{3}{subsubsection.2.3.1}
    9.15 -\contentsline {subsubsection}{\numberline {2.3.2}Analyse}{4}{subsubsection.2.3.2}
    9.16 -\contentsline {subsection}{\numberline {2.4}Segmentschnitt}{4}{subsection.2.4}
    9.17 -\contentsline {subsubsection}{\numberline {2.4.1}Algorithmus}{4}{subsubsection.2.4.1}
    9.18 -\contentsline {subsubsection}{\numberline {2.4.2}Analyse}{5}{subsubsection.2.4.2}
    9.19 -\contentsline {subsection}{\numberline {2.5}Polynomprodukt und Fast Fourier-Transformation}{5}{subsection.2.5}
    9.20 -\contentsline {section}{\numberline {3}Randomisierung}{6}{section.3}
    9.21 -\contentsline {subsection}{\numberline {3.1}Hashing}{6}{subsection.3.1}
    9.22 -\contentsline {section}{\numberline {4}Amortisierte Analyse}{7}{section.4}
    9.23 -\contentsline {subsection}{\numberline {4.1}Binomial Heaps}{7}{subsection.4.1}
    9.24 -\contentsline {subsection}{\numberline {4.2}Fibonacci Heaps}{7}{subsection.4.2}
    9.25 -\contentsline {subsection}{\numberline {4.3}Union Find}{7}{subsection.4.3}
    9.26 -\contentsline {section}{\numberline {5}Greedy}{8}{section.5}
    9.27 -\contentsline {subsection}{\numberline {5.1}K\"urzeste (billigste) Wege}{8}{subsection.5.1}
    9.28 -\contentsline {section}{\numberline {6}Bin Packing}{9}{section.6}
    9.29 -\contentsline {subsection}{\numberline {6.1}Online Verfahren}{9}{subsection.6.1}
    9.30 -\contentsline {subsubsection}{\numberline {6.1.1}Next Fit (NF)}{9}{subsubsection.6.1.1}
    9.31 -\contentsline {subsubsection}{\numberline {6.1.2}First-Fit (FF)}{9}{subsubsection.6.1.2}
    9.32 -\contentsline {subsubsection}{\numberline {6.1.3}Best-Fit (BF)}{10}{subsubsection.6.1.3}
    9.33 -\contentsline {subsection}{\numberline {6.2}Offline Verfahren}{10}{subsection.6.2}
    9.34 -\contentsline {subsubsection}{\numberline {6.2.1}First Fit Decreasing (FFD oder FFNI)}{10}{subsubsection.6.2.1}
    9.35 -\contentsline {subsubsection}{\numberline {6.2.2}Best Fit Decreasing (BFD)}{10}{subsubsection.6.2.2}
    9.36 -\contentsline {section}{\numberline {7}Dynamische Programmierung}{11}{section.7}
    9.37 -\contentsline {section}{\numberline {A}Landau-Symbole}{12}{appendix.A}