{"id":66,"date":"2020-10-02T12:29:20","date_gmt":"2020-10-02T10:29:20","guid":{"rendered":"http:\/\/aud.ibr.cs.tu-bs.de\/?page_id=66"},"modified":"2021-05-12T18:14:32","modified_gmt":"2021-05-12T16:14:32","slug":"kapitel-1","status":"publish","type":"page","link":"https:\/\/aud2.ibr.cs.tu-bs.de\/index.php\/kapitel\/kapitel-1\/","title":{"rendered":"Kapitel 1 &#8211; Einstieg"},"content":{"rendered":"\n<h2>Inhalt<\/h2>\n\n\n\n<p>In diesem Kapitel diskutieren wir einige grundlegende Fragen auf Basis des Knapsack(Rucksack)-Problems. Dabei geht es vor allem darum in welchen Varianten sich so ein grundlegendes Problem betrachten l\u00e4sst und wie sich schlie\u00dflich L\u00f6sungen f\u00fcr die verschiedenen Probleme finden lassen.<\/p>\n\n\n\n<p class=\"has-medium-font-size\"><strong>Termine<\/strong><\/p>\n\n\n\n<ul><li><a href=\"https:\/\/aud2.ibr.cs.tu-bs.de\/index.php\/2021\/04\/20\/vorlesung-1\/\">Vorlesung 1<\/a> am 20.04.21: Einf\u00fchrung: Knapsack-Problem und Varianten<\/li><li><a href=\"https:\/\/aud2.ibr.cs.tu-bs.de\/index.php\/2021\/04\/21\/vorlesung-1-2\/\">\u00dcbung 0<\/a> am 21.04.21: Organisation, Wiederholung AuD1, Greedy f\u00fcr Knacksack-Probleme. <\/li><li><a href=\"https:\/\/aud2.ibr.cs.tu-bs.de\/index.php\/2021\/04\/27\/vorlesung-2-2\/\">Vorlesung 2<\/a> am 27.04.21: Greedy-Algorithmus f\u00fcr Fractional Matching; Subset Sum<\/li><li><a href=\"https:\/\/aud2.ibr.cs.tu-bs.de\/index.php\/2021\/05\/05\/uebung-0\/\">\u00dcbung 1<\/a> am 05.05.21: Greedy-Algorithmen, H\u00f6rsaal-Belegung<\/li><\/ul>\n\n\n\n<p><\/p>\n\n\n\n<h2>Veranstaltungen<\/h2>\n\n\n<ul class=\"wp-block-latest-posts__list has-dates wp-block-latest-posts\"><li><div class=\"wp-block-latest-posts__featured-image\"><img width=\"300\" height=\"170\" src=\"https:\/\/aud2.ibr.cs.tu-bs.de\/wp-content\/uploads\/2021\/05\/U1-300x170.jpg\" class=\"attachment-medium size-medium wp-post-image\" alt=\"\" loading=\"lazy\" style=\"max-width:400px;\" srcset=\"https:\/\/aud2.ibr.cs.tu-bs.de\/wp-content\/uploads\/2021\/05\/U1-300x170.jpg 300w, https:\/\/aud2.ibr.cs.tu-bs.de\/wp-content\/uploads\/2021\/05\/U1-1024x581.jpg 1024w, https:\/\/aud2.ibr.cs.tu-bs.de\/wp-content\/uploads\/2021\/05\/U1-768x436.jpg 768w, https:\/\/aud2.ibr.cs.tu-bs.de\/wp-content\/uploads\/2021\/05\/U1-1536x872.jpg 1536w, https:\/\/aud2.ibr.cs.tu-bs.de\/wp-content\/uploads\/2021\/05\/U1.jpg 1558w\" sizes=\"(max-width: 300px) 100vw, 300px\" \/><\/div><a href=\"https:\/\/aud2.ibr.cs.tu-bs.de\/index.php\/2021\/05\/05\/uebung-0\/\">\u00dcbung 1<\/a><time datetime=\"2021-05-05T14:30:00+02:00\" class=\"wp-block-latest-posts__post-date\">5. Mai 2021<\/time><div class=\"wp-block-latest-posts__post-excerpt\">In dieser \u00dcbung besch\u00e4ftigen wir uns noch einmal intensiver mit Greedy-Algorithmen. Wir schauen uns dazu das H\u00f6rsaal-Belegungsproblem genauer an.<\/div><\/li>\n<li><div class=\"wp-block-latest-posts__featured-image\"><img width=\"300\" height=\"221\" src=\"https:\/\/aud2.ibr.cs.tu-bs.de\/wp-content\/uploads\/2021\/04\/Greedy_algorithm_36_cents.svg_-300x221.png\" class=\"attachment-medium size-medium wp-post-image\" alt=\"\" loading=\"lazy\" style=\"max-width:400px;\" srcset=\"https:\/\/aud2.ibr.cs.tu-bs.de\/wp-content\/uploads\/2021\/04\/Greedy_algorithm_36_cents.svg_-300x221.png 300w, https:\/\/aud2.ibr.cs.tu-bs.de\/wp-content\/uploads\/2021\/04\/Greedy_algorithm_36_cents.svg_-1024x754.png 1024w, https:\/\/aud2.ibr.cs.tu-bs.de\/wp-content\/uploads\/2021\/04\/Greedy_algorithm_36_cents.svg_-768x565.png 768w, https:\/\/aud2.ibr.cs.tu-bs.de\/wp-content\/uploads\/2021\/04\/Greedy_algorithm_36_cents.svg_.png 1280w\" sizes=\"(max-width: 300px) 100vw, 300px\" \/><\/div><a href=\"https:\/\/aud2.ibr.cs.tu-bs.de\/index.php\/2021\/04\/27\/vorlesung-2-2\/\">Vorlesung 2<\/a><time datetime=\"2021-04-27T11:30:00+02:00\" class=\"wp-block-latest-posts__post-date\">27. April 2021<\/time><div class=\"wp-block-latest-posts__post-excerpt\">In dieser Vorlesung lernen wir die Familie der Greedy-Algorithmen kennen und schauen uns je ein Beispiel f\u00fcr die Probleme Fractional Matching und Subset Sum an.  <\/div><\/li>\n<li><div class=\"wp-block-latest-posts__featured-image\"><img width=\"300\" height=\"169\" src=\"https:\/\/aud2.ibr.cs.tu-bs.de\/wp-content\/uploads\/2021\/04\/U0-1-300x169.jpg\" class=\"attachment-medium size-medium wp-post-image\" alt=\"\" loading=\"lazy\" style=\"max-width:400px;\" srcset=\"https:\/\/aud2.ibr.cs.tu-bs.de\/wp-content\/uploads\/2021\/04\/U0-1-300x169.jpg 300w, https:\/\/aud2.ibr.cs.tu-bs.de\/wp-content\/uploads\/2021\/04\/U0-1-1024x577.jpg 1024w, https:\/\/aud2.ibr.cs.tu-bs.de\/wp-content\/uploads\/2021\/04\/U0-1-768x433.jpg 768w, https:\/\/aud2.ibr.cs.tu-bs.de\/wp-content\/uploads\/2021\/04\/U0-1.jpg 1376w\" sizes=\"(max-width: 300px) 100vw, 300px\" \/><\/div><a href=\"https:\/\/aud2.ibr.cs.tu-bs.de\/index.php\/2021\/04\/21\/vorlesung-1-2\/\">\u00dcbung 0<\/a><time datetime=\"2021-04-21T16:45:00+02:00\" class=\"wp-block-latest-posts__post-date\">21. April 2021<\/time><div class=\"wp-block-latest-posts__post-excerpt\">In der ersten \u00dcbung kl\u00e4ren wir einmal grundlegende organisatorische Fragen. Anschlie\u00dfend gibt es eine kleine Widerholung zu AuD 1 und wir schauen uns noch einmal den Greedy-Algorithmus zu Fractional Knapsack an.<\/div><\/li>\n<li><div class=\"wp-block-latest-posts__featured-image\"><img width=\"300\" height=\"260\" src=\"https:\/\/aud2.ibr.cs.tu-bs.de\/wp-content\/uploads\/2021\/04\/Knapsack.svg_-300x260.png\" class=\"attachment-medium size-medium wp-post-image\" alt=\"\" loading=\"lazy\" style=\"max-width:400px;\" srcset=\"https:\/\/aud2.ibr.cs.tu-bs.de\/wp-content\/uploads\/2021\/04\/Knapsack.svg_-300x260.png 300w, https:\/\/aud2.ibr.cs.tu-bs.de\/wp-content\/uploads\/2021\/04\/Knapsack.svg_-1024x887.png 1024w, https:\/\/aud2.ibr.cs.tu-bs.de\/wp-content\/uploads\/2021\/04\/Knapsack.svg_-768x665.png 768w, https:\/\/aud2.ibr.cs.tu-bs.de\/wp-content\/uploads\/2021\/04\/Knapsack.svg_.png 1182w\" sizes=\"(max-width: 300px) 100vw, 300px\" \/><\/div><a href=\"https:\/\/aud2.ibr.cs.tu-bs.de\/index.php\/2021\/04\/20\/vorlesung-1\/\">Vorlesung 1<\/a><time datetime=\"2021-04-20T11:30:00+02:00\" class=\"wp-block-latest-posts__post-date\">20. April 2021<\/time><div class=\"wp-block-latest-posts__post-excerpt\">In dieser Vorlesung geben wir eine Einf\u00fchrung in Knapsack-Probleme und damit verbundene Varianten. <\/div><\/li>\n<\/ul>\n\n\n<p><\/p>\n","protected":false},"excerpt":{"rendered":"<p>Inhalt In diesem Kapitel diskutieren wir einige grundlegende Fragen auf Basis des Knapsack(Rucksack)-Problems. Dabei geht es vor allem darum in welchen Varianten sich so ein grundlegendes Problem betrachten l\u00e4sst und wie sich schlie\u00dflich L\u00f6sungen f\u00fcr die verschiedenen Probleme finden lassen. Termine Vorlesung 1 am 20.04.21: Einf\u00fchrung: Knapsack-Problem und Varianten \u00dcbung 0 am 21.04.21: Organisation, Wiederholung &hellip;<\/p>\n<p class=\"read-more\"> <a class=\"\" href=\"https:\/\/aud2.ibr.cs.tu-bs.de\/index.php\/kapitel\/kapitel-1\/\"> <span class=\"screen-reader-text\">Kapitel 1 &#8211; Einstieg<\/span> Weiterlesen &raquo;<\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"parent":30,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"site-sidebar-layout":"default","site-content-layout":"default","ast-main-header-display":"","ast-hfb-above-header-display":"","ast-hfb-below-header-display":"","ast-hfb-mobile-header-display":"","site-post-title":"","ast-breadcrumbs-content":"","ast-featured-img":"","footer-sml-layout":"","theme-transparent-header-meta":"","adv-header-id-meta":"","stick-header-meta":"","header-above-stick-meta":"","header-main-stick-meta":"","header-below-stick-meta":"","_expiration-date-status":"saved","_expiration-date":0,"_expiration-date-type":"","_expiration-date-categories":[],"_expiration-date-options":[]},"_links":{"self":[{"href":"https:\/\/aud2.ibr.cs.tu-bs.de\/index.php\/wp-json\/wp\/v2\/pages\/66"}],"collection":[{"href":"https:\/\/aud2.ibr.cs.tu-bs.de\/index.php\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/aud2.ibr.cs.tu-bs.de\/index.php\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/aud2.ibr.cs.tu-bs.de\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/aud2.ibr.cs.tu-bs.de\/index.php\/wp-json\/wp\/v2\/comments?post=66"}],"version-history":[{"count":18,"href":"https:\/\/aud2.ibr.cs.tu-bs.de\/index.php\/wp-json\/wp\/v2\/pages\/66\/revisions"}],"predecessor-version":[{"id":815,"href":"https:\/\/aud2.ibr.cs.tu-bs.de\/index.php\/wp-json\/wp\/v2\/pages\/66\/revisions\/815"}],"up":[{"embeddable":true,"href":"https:\/\/aud2.ibr.cs.tu-bs.de\/index.php\/wp-json\/wp\/v2\/pages\/30"}],"wp:attachment":[{"href":"https:\/\/aud2.ibr.cs.tu-bs.de\/index.php\/wp-json\/wp\/v2\/media?parent=66"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}