{"id":276,"date":"2013-09-05T07:52:03","date_gmt":"2013-09-05T07:52:03","guid":{"rendered":"http:\/\/www.cs.uleth.ca\/~benkoczi\/wordpress\/?p=276"},"modified":"2013-11-27T18:23:52","modified_gmt":"2013-11-27T18:23:52","slug":"lectures","status":"publish","type":"post","link":"https:\/\/www.cs.uleth.ca\/~benkoczi\/wordpress\/?p=276","title":{"rendered":"Approximation algorithms &#8211; Lectures"},"content":{"rendered":"<dl>\n<dt> Sep 5 &#8211; 19 <\/dt>\n<dd> Read Chapter 1 &#8211; Introduction and Appendix A &#8211; Linear programing.<\/dd>\n<dt> Sep 19 &#8211; 26<\/dt>\n<dd>Read Chapter 2 (greedy and local search): The k-center + scheduling with deadlines on a single machine + scheduling on parallel identical  machines.<\/dd>\n<dt> Oct 1-3 <\/dt>\n<dd> Chapter 2: TSP + Max float <\/dd>\n<dt> Oct 8-10 <\/dt>\n<dd> Chapter 2: edge colouring, Chapter 3 (rounding data and PTAS): a PTAS for the knapsack problem <\/dd>\n<dt> Oct 15-17 <\/dt>\n<dd> Chapter 3: PTAS for scheduling on identical parallel machines <\/dd>\n<dt> Oct 22-24 <\/dt>\n<dd> Chapter 3: scheduling on identical parallel machines, bin packing <\/dd>\n<dt> Oct 29-Nov 14 <\/dt>\n<dd> Chapter 4 (deterministic rounding): sections 4.1 &#8211; 4.5 (job scheduling to minimize weighted sum of completion times, the ellipsoid algorithm, prize collecting Steiner tree and UFL)<\/dd>\n<dt> Nov 19-28 <\/dt>\n<dd> Student presentations (shortest super-string, Canadian traveller in double valued graphs, PTAS for max-colouring in trees, minimum knapsack greedy and primal-dual (Section 7.5), asymmetric TSP, and partial set cover).<\/p>\n<dt> Dec 3-5<\/dt>\n<dd> Chapter 7 (primal-dual): 7.2, 7.6 (feedback vertex set, UFL)\n<\/dl>\n","protected":false},"excerpt":{"rendered":"<p>Sep 5 &#8211; 19 Read Chapter 1 &#8211; Introduction and Appendix A &#8211; Linear programing. Sep 19 &#8211; 26 Read Chapter 2 (greedy and local search): The k-center + scheduling with deadlines on a single machine + scheduling on parallel &hellip; <a href=\"https:\/\/www.cs.uleth.ca\/~benkoczi\/wordpress\/?p=276\">Continue reading <span class=\"meta-nav\">&rarr;<\/span><\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[16],"tags":[],"class_list":["post-276","post","type-post","status-publish","format-standard","hentry","category-approx-course"],"_links":{"self":[{"href":"https:\/\/www.cs.uleth.ca\/~benkoczi\/wordpress\/index.php?rest_route=\/wp\/v2\/posts\/276","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.cs.uleth.ca\/~benkoczi\/wordpress\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.cs.uleth.ca\/~benkoczi\/wordpress\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.cs.uleth.ca\/~benkoczi\/wordpress\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.cs.uleth.ca\/~benkoczi\/wordpress\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=276"}],"version-history":[{"count":12,"href":"https:\/\/www.cs.uleth.ca\/~benkoczi\/wordpress\/index.php?rest_route=\/wp\/v2\/posts\/276\/revisions"}],"predecessor-version":[{"id":294,"href":"https:\/\/www.cs.uleth.ca\/~benkoczi\/wordpress\/index.php?rest_route=\/wp\/v2\/posts\/276\/revisions\/294"}],"wp:attachment":[{"href":"https:\/\/www.cs.uleth.ca\/~benkoczi\/wordpress\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=276"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.cs.uleth.ca\/~benkoczi\/wordpress\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=276"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.cs.uleth.ca\/~benkoczi\/wordpress\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=276"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}