{"id":68,"date":"2020-10-02T12:29:47","date_gmt":"2020-10-02T10:29:47","guid":{"rendered":"http:\/\/aud.ibr.cs.tu-bs.de\/?page_id=68"},"modified":"2021-05-12T18:12:30","modified_gmt":"2021-05-12T16:12:30","slug":"kapitel-2","status":"publish","type":"page","link":"https:\/\/aud2.ibr.cs.tu-bs.de\/index.php\/kapitel\/kapitel-2\/","title":{"rendered":"Kapitel 2 &#8211; Dynamic Programming"},"content":{"rendered":"\n<h2>Inhalt<\/h2>\n\n\n\n<p>In diesem Kapitel lernen wir das Prinzip von Dynamic Programming (zu Deutsch dynamische Programmierung) kennen und schauen uns unter anderem Dynamic Programming Ans\u00e4tze f\u00fcr die bereits bekannten Subset Sum- und Knapsack-Probleme an. <\/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\/05\/04\/vorlesung-3\/\">Vorlesung 3<\/a> am 04.05.21: Dynamic Programming f\u00fcr Subset Sum<\/li><li><a href=\"https:\/\/aud2.ibr.cs.tu-bs.de\/index.php\/2021\/05\/11\/vorlesung-4\/\">Vorlesung 4<\/a> am 11.05.21: Dynamic Programming f\u00fcr Knapsack; Dynamic Programming f\u00fcr zwei geometrische Probleme<\/li><li><a href=\"https:\/\/aud2.ibr.cs.tu-bs.de\/index.php\/2021\/05\/12\/uebung-1\/\">\u00dcbung 2<\/a> am 12.05.21: Dynamic Programming f\u00fcr Longest Common Subsequence und Matrix Chain Multiplication.<\/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=\"169\" src=\"https:\/\/aud2.ibr.cs.tu-bs.de\/wp-content\/uploads\/2021\/05\/U2-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\/05\/U2-300x169.jpg 300w, https:\/\/aud2.ibr.cs.tu-bs.de\/wp-content\/uploads\/2021\/05\/U2-1024x576.jpg 1024w, https:\/\/aud2.ibr.cs.tu-bs.de\/wp-content\/uploads\/2021\/05\/U2-768x432.jpg 768w, https:\/\/aud2.ibr.cs.tu-bs.de\/wp-content\/uploads\/2021\/05\/U2.jpg 1371w\" sizes=\"(max-width: 300px) 100vw, 300px\" \/><\/div><a href=\"https:\/\/aud2.ibr.cs.tu-bs.de\/index.php\/2021\/05\/12\/uebung-1\/\">\u00dcbung 2<\/a><time datetime=\"2021-05-12T14:30:00+02:00\" class=\"wp-block-latest-posts__post-date\">12. Mai 2021<\/time><div class=\"wp-block-latest-posts__post-excerpt\">In dieser \u00dcbung besch\u00e4ftigen wir uns intensiver mit Dynamic Programming. Daf\u00fcr schauen wir uns mit Longest Common Subsequence und Matrix Chain Multiplication zwei neue Probleme an und konstruieren schrittweise Dynamic Programming Ans\u00e4tze, um sie zu l\u00f6sen.<\/div><\/li>\n<li><div class=\"wp-block-latest-posts__featured-image\"><img width=\"300\" height=\"133\" src=\"https:\/\/aud2.ibr.cs.tu-bs.de\/wp-content\/uploads\/2021\/05\/travelling_salesman_problem-300x133.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\/05\/travelling_salesman_problem-300x133.png 300w, https:\/\/aud2.ibr.cs.tu-bs.de\/wp-content\/uploads\/2021\/05\/travelling_salesman_problem.png 640w\" sizes=\"(max-width: 300px) 100vw, 300px\" \/><\/div><a href=\"https:\/\/aud2.ibr.cs.tu-bs.de\/index.php\/2021\/05\/11\/vorlesung-4\/\">Vorlesung 4<\/a><time datetime=\"2021-05-11T09:30:00+02:00\" class=\"wp-block-latest-posts__post-date\">11. Mai 2021<\/time><div class=\"wp-block-latest-posts__post-excerpt\">In dieser Vorlesung betrachten wir weitere Dynamic Programming &#8211; Ans\u00e4tze an. Dabei geht es unter Anderem um das bekannte Knapsack-Problem. Zudem betrachten wir zwei geometrische Probleme.<\/div><\/li>\n<li><div class=\"wp-block-latest-posts__featured-image\"><img width=\"300\" height=\"97\" src=\"https:\/\/aud2.ibr.cs.tu-bs.de\/wp-content\/uploads\/2021\/04\/dynamic-300x97.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\/dynamic-300x97.jpg 300w, https:\/\/aud2.ibr.cs.tu-bs.de\/wp-content\/uploads\/2021\/04\/dynamic-1024x331.jpg 1024w, https:\/\/aud2.ibr.cs.tu-bs.de\/wp-content\/uploads\/2021\/04\/dynamic-768x248.jpg 768w, https:\/\/aud2.ibr.cs.tu-bs.de\/wp-content\/uploads\/2021\/04\/dynamic.jpg 1218w\" sizes=\"(max-width: 300px) 100vw, 300px\" \/><\/div><a href=\"https:\/\/aud2.ibr.cs.tu-bs.de\/index.php\/2021\/05\/04\/vorlesung-3\/\">Vorlesung 3<\/a><time datetime=\"2021-05-04T09:30:00+02:00\" class=\"wp-block-latest-posts__post-date\">4. Mai 2021<\/time><div class=\"wp-block-latest-posts__post-excerpt\">In dieser Vorlesung lernen wir eine neue Methode zum exakten L\u00f6sen von Problemen kennen: Dynamic Programming. Wir beginnen damit dynamische Programme anhand von Beispielen f\u00fcr Knapsack- und Subset Sum-Probleme zu betrachten. <\/div><\/li>\n<\/ul>\n\n\n<p><\/p>\n","protected":false},"excerpt":{"rendered":"<p>Inhalt In diesem Kapitel lernen wir das Prinzip von Dynamic Programming (zu Deutsch dynamische Programmierung) kennen und schauen uns unter anderem Dynamic Programming Ans\u00e4tze f\u00fcr die bereits bekannten Subset Sum- und Knapsack-Probleme an. Termine Vorlesung 3 am 04.05.21: Dynamic Programming f\u00fcr Subset Sum Vorlesung 4 am 11.05.21: Dynamic Programming f\u00fcr Knapsack; Dynamic Programming f\u00fcr zwei &hellip;<\/p>\n<p class=\"read-more\"> <a class=\"\" href=\"https:\/\/aud2.ibr.cs.tu-bs.de\/index.php\/kapitel\/kapitel-2\/\"> <span class=\"screen-reader-text\">Kapitel 2 &#8211; Dynamic Programming<\/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\/68"}],"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=68"}],"version-history":[{"count":9,"href":"https:\/\/aud2.ibr.cs.tu-bs.de\/index.php\/wp-json\/wp\/v2\/pages\/68\/revisions"}],"predecessor-version":[{"id":808,"href":"https:\/\/aud2.ibr.cs.tu-bs.de\/index.php\/wp-json\/wp\/v2\/pages\/68\/revisions\/808"}],"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=68"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}