{"id":338,"date":"2013-10-18T04:28:04","date_gmt":"2013-10-18T04:28:04","guid":{"rendered":"http:\/\/www.cs.uleth.ca\/~benkoczi\/wordpress\/?p=338"},"modified":"2014-10-13T03:22:21","modified_gmt":"2014-10-13T03:22:21","slug":"midterm-exam-thr-october-31-2013","status":"publish","type":"post","link":"https:\/\/www.cs.uleth.ca\/~benkoczi\/wordpress\/?p=338","title":{"rendered":"Midterm exam &#8211; Thr. October 31, 2013"},"content":{"rendered":"<p>Happy Haloween!<br \/>\nExam duration: 75 minutes, in class, on Thr. Oct 31, 2013.<\/p>\n<p><strong>Exam preparation guidelines:<\/strong><\/p>\n<ul>\n<li>Chapters covered: 1, 2 (excluding section 2.6); 3.1 <\/li>\n<li>Review linear programming<\/li>\n<li>Attempt the following exercises from the text: 1.1 (use the greedy algorithm), 1.2 (use the unweighted set cover problem); 1.6a; 2.1 &#8211; 2.4a; 2.5 (first convince yourselves that the MST on $G[R]$ is not optimal for the Steiner tree problem; then consider an optimal Steiner tree solution, make the tree Eulerian, and shortcut all the non-terminal vertices. What do you get?); 2.6; 2.11a; 2.16; 3.1, 3.2<\/li>\n<\/ul>\n","protected":false},"excerpt":{"rendered":"<p>Happy Haloween! Exam duration: 75 minutes, in class, on Thr. Oct 31, 2013. Exam preparation guidelines: Chapters covered: 1, 2 (excluding section 2.6); 3.1 Review linear programming Attempt the following exercises from the text: 1.1 (use the greedy algorithm), 1.2 &hellip; <a href=\"https:\/\/www.cs.uleth.ca\/~benkoczi\/wordpress\/?p=338\">Continue reading <span class=\"meta-nav\">&rarr;<\/span><\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[16],"tags":[],"class_list":["post-338","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\/338","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=338"}],"version-history":[{"count":6,"href":"https:\/\/www.cs.uleth.ca\/~benkoczi\/wordpress\/index.php?rest_route=\/wp\/v2\/posts\/338\/revisions"}],"predecessor-version":[{"id":438,"href":"https:\/\/www.cs.uleth.ca\/~benkoczi\/wordpress\/index.php?rest_route=\/wp\/v2\/posts\/338\/revisions\/438"}],"wp:attachment":[{"href":"https:\/\/www.cs.uleth.ca\/~benkoczi\/wordpress\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=338"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.cs.uleth.ca\/~benkoczi\/wordpress\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=338"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.cs.uleth.ca\/~benkoczi\/wordpress\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=338"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}