Waldstadt. Schlossgartenbahn. Kronenplatz S1 S11. KVV.bike. zentrum Hbf S1 S11 S4 S41. Tivoli. Poststr. S31 S32 (RE4) Flinkster Mein Carsharing

Größe: px

Ab Seite anzeigen:

Download "Waldstadt. Schlossgartenbahn. Kronenplatz S1 S11. KVV.bike. zentrum Hbf S1 S11 S4 S41. Tivoli. Poststr. S31 S32 (RE4) Flinkster Mein Carsharing"

Berndt Ackermann
vor 6 Jahren
Abrufe

1 0 S 8 Hochstetten Blankenloch Friedrichstal Bf S S S S S S R /RE Entenfang Philippstr. Händelstr. S Lessingstr. O.-Sachs-Str. S S R S S S S Waldstadt S S S S S S S S S S Tivoli Schloss Gottesaue/ Hochschule für Musik Rüppurrer Tor Ostendstr. Philipp-Reis-Str./ die neue welle Werderstr. Call a Bike Reitschulschlag Mühlburger Feld Schillerstr. KVV.bike 0 Kühler Krug Ettlinger Tor Sophienstr. Karlstor Volkswohnung/ ts Hübschstr. Konzerthaus Staatstheater rstr. KA West enstr. 0 Weinbrennerplatz Arbeitsagentur Landesbausparkasse Kolping- zentrum Mathystr. Kongress- nn-str. Hbf 0 ZKM platz Vorplatz Augartenstr. Europahalle/Europabad S S Welfenstr. S Bannwaldallee Ebertstr. S S (verkehrt nur zu bestimmten Veranstaltungen) Barbarossaplatz Tivoli Poststr. M M esse-express) Hardecksiedlung Albtalbahnhof S e Albert-Braun-Str. S S S R / RE R R R9 (RE) S S Oberreut Zentrum KA-Hauptbahnhof Wilhelm-Leuschner-Str. Forchheim R R9 Badeniaplatz M 0 Karlsruhe Hbf Oberreut Durmersheim Nord Durmersheim Bf Dammerstock Ettlingen West Schloss Rüppurr Bietigheim Ostendorfplatz Glantz, Meyerhenke: Rastatt KIT Universität des Landes Baden-Württemberg und nationales Graph Forschungszentrum Algorithms in der Helmholtz-Gemeinschaft th Neureut Heide Siemensallee Schedule and Presentation of Topics, July 7, 0 Rintheim nielingen Henning Meyerhenke, Roland Glantz, Elisabetta Bergamini, Moritz von Looz Hirtenweg Hertzstr. Schlossgartenbahn Siemens Institute Städt. of Klinikum/ Theoretical Knielinger Informatics Allee Kunstakademie/Hochschule (ITI), KIT Hauptfriedhof Rintheimer Str. Mühlburg West Kußmaulstr. Städtisches Klinikum/ Moltkestr. Starckstr. Europaplatz Karl-Wilhelm-Platz Lameyplatz Europaplatz/ Kronenplatz KIT-Campus Süd Gottesauer Mühlburger Tor Durlacher Tor/ Post Galerie Herrenstr. Marktplatz Yorckstr. S S Platz/BGV burg S S S S S S S S S S S S S S Flinkster Mein Carsharing S R S S R R9 (RE) R R9 R R Tullastraße Tullastr./VBK S S (RE) Wolfartsweierer Str. S R S S Ellmendinger Str. Ostmarkstr. Schlesier Str. (West) Weinweg Untermühlstr. Hubstr. Gritznerstr. Killisfeldstr. Steiermärker Str. Zündhütle Wolfartsweier Nord Wolfartsweier S 8 S S S S R KA-Durlach Grötzingen Bf Call a Bike Auer Str./ Dr. W. Schwabe Karl- Weysser-Str. Oberausstr. R S Dürre Wössinge S R J Ber Krappmühle Berghause Bergha Ber S P B Brötzing Brötzingen Wo Birk Friedrichschule Schlossplatz Durlach Turmberg Turmbergbahn

2 Schedule Until September 0: Binding registration Glantz, Meyerhenke:

3 Schedule Until September 0: Binding registration October 0, : 8:00 in SR 00: Introduction to presentation techniques (H. Meyerhenke) Presentation of topics by the participants Glantz, Meyerhenke:

4 Schedule Until September 0: Binding registration October 0, : 8:00 in SR 00: Introduction to presentation techniques (H. Meyerhenke) Presentation of topics by the participants November 0, : 8:00 in SR 00: Presentations November, : 8:00 in SR 00: Presentations November 0, : 8:00 in SR 00: Presentations 7 9 Glantz, Meyerhenke:

5 Schedule Until September 0: Binding registration October 0, : 8:00 in SR 00: Introduction to presentation techniques (H. Meyerhenke) Presentation of topics by the participants November 0, : 8:00 in SR 00: Presentations November, : 8:00 in SR 00: Presentations November 0, : 8:00 in SR 00: Presentations 7 9 December : Deadline for written summary A LaTeX template will be available on About 0 pages of content (i.e., without title and bibliography pages) Glantz, Meyerhenke:

6 Theorems by König und Vizing on Edge Chromatic Number χ (G) = (G) for bipartitie graphs [] χ (G) (G) + in general [] More on class one and class two graphs Glantz, Meyerhenke:

7 Edge Coloring by Misra and Gries fan alternating path The algorithm [8] Proof of correctness and complexity [8] Glantz, Meyerhenke:

8 Greedy / Matroids Definition and examples of matroids [9, 7] Greedy algorithm on matroids [9, 7] From greedy algorithms to matroids [9, 7] Glantz, Meyerhenke:

9 Fast MST by Fredman and Tarjan From trees to trees of trees Remind us of Prim s algorithm [7] Drawbacks of Prim s algorithm [7, ] Algorithm by Fredman and Tarjan [7, ] Running time [7] Glantz, Meyerhenke:

10 A Algorithm for Shortest Paths Original A algorithm [] Use of A algorithm in route planning [] 7 Glantz, Meyerhenke:

11 Approximation of Min-Steiner-Trees K = {,,, } MST Steiner tree Definitions, examples [7] Approximation algorithm for Steiner trees, correctness [7] 8 Glantz, Meyerhenke:

12 Blossom Algorithm for Maximum Matching Augmenting paths [] Blossoms and blossom contraction [] The complete algorithm [] 9 Glantz, Meyerhenke:

13 Minimum Cuts by Karger and Stein minimum cut contraction Edge contraction: definition and implementation [] Statistics [] Sequential Karger-Stein algorithm [] 0 Glantz, Meyerhenke:

14 Tree Decomposition Definition and examples [7] Tree decompositions of trees [7] Properties of tree decompositions (cliques, minors) [7] Calculating tree decompositions of (chordal) graphs [7] Glantz, Meyerhenke:

15 References (). R. Diestel. Graph Theory, volume 7 of Graduate Texts in Mathematics. Springer, 00.. J. Edmonds. Paths, trees, and flowers. Canad. J. Math., 7:9 7, 9.. J. Eisner. State-of-the-art algorithms for minimum spanning trees - a tutorial discussion, A. V. Goldberg and C. Harrelson. Computing the shortest path: A search meets graph theory. In Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 0, pages, Philadelphia, PA, USA, 00. Society for Industrial and Applied Mathematics. Glantz, Meyerhenke:

16 References (). P. E. Hart, N. J. Nilsson, and B. Raphael. A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems, Science, and Cybernetics, SSC-():00 07, 98.. D. R. Karger and C. Stein. A new approach to the minimum cut problem. J. ACM, ():0 0, S.O. Krumke and H. Noltemeier. Graphentheoretische Konzepte und Algorithmen. Leitfäden der Informatik. Vieweg + Teubner, J. Misra and D. Gries. A constructive proof of Vizing s theorem. Information Processing Letters,, 99. Glantz, Meyerhenke:

17 References () 9. J.G. Oxley. Matroid theory. Oxford University Press, New York, USA, 99. Glantz, Meyerhenke:

Ähnliche Dokumente

Photo : J- P. WOLFF KARLSRUHE THEATER

Photo : J- P. WOLFF KARLSRUHE THEATER KARLSRUHE THEATER 3 4 1 3 4 8 4 3 4 S Bellheim Bf Rülzheim Bf Rülzheim Freizeitzentrum Rheinzabern Bf Rheinzabern Rappengasse Rheinzabern Alte Römerstr. ockgrim Bf rth Zügelstr. rth Bf Wörth Maximiliansau