{"id":271,"date":"2013-09-05T07:39:37","date_gmt":"2013-09-05T07:39:37","guid":{"rendered":"http:\/\/www.cs.uleth.ca\/~benkoczi\/wordpress\/?p=271"},"modified":"2014-01-09T09:14:56","modified_gmt":"2014-01-09T09:14:56","slug":"cpsc-41105110-advanced-algorithms-approximations","status":"publish","type":"post","link":"https:\/\/www.cs.uleth.ca\/~benkoczi\/wordpress\/?p=271","title":{"rendered":"CPSC 4110\/5110 &#8211; Advanced Algorithms (Approximations)"},"content":{"rendered":"<p>This course is about designing approximation algorithms for difficult<br \/>\noptimization problems for which no optimal algorithms with running<br \/>\ntime polynomial in the problem size are known. Approximation<br \/>\nalgorithms find feasible solutions that may not be optimal but are not<br \/>\ntoo far from the optimal one. <\/p>\n<p>We overview various interesting<br \/>\nalgorithm design techniques that may prove extremely useful to<br \/>\ngraduate students tackling research questions in various fields and to<br \/>\nundergraduates who may encounter interesting problems in their future<br \/>\nprojects in the industry. <\/p>\n<p> <a href=\"http:\/\/www.cs.uleth.ca\/~benkoczi\/wordpress\/?page_id=265\">[course wbpage]<\/a> <\/p>\n","protected":false},"excerpt":{"rendered":"<p>This course is about designing approximation algorithms for difficult optimization problems for which no optimal algorithms with running time polynomial in the problem size are known. Approximation algorithms find feasible solutions that may not be optimal but are not too &hellip; <a href=\"https:\/\/www.cs.uleth.ca\/~benkoczi\/wordpress\/?p=271\">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":[13],"tags":[],"class_list":["post-271","post","type-post","status-publish","format-standard","hentry","category-course-archive"],"_links":{"self":[{"href":"https:\/\/www.cs.uleth.ca\/~benkoczi\/wordpress\/index.php?rest_route=\/wp\/v2\/posts\/271","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=271"}],"version-history":[{"count":3,"href":"https:\/\/www.cs.uleth.ca\/~benkoczi\/wordpress\/index.php?rest_route=\/wp\/v2\/posts\/271\/revisions"}],"predecessor-version":[{"id":418,"href":"https:\/\/www.cs.uleth.ca\/~benkoczi\/wordpress\/index.php?rest_route=\/wp\/v2\/posts\/271\/revisions\/418"}],"wp:attachment":[{"href":"https:\/\/www.cs.uleth.ca\/~benkoczi\/wordpress\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=271"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.cs.uleth.ca\/~benkoczi\/wordpress\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=271"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.cs.uleth.ca\/~benkoczi\/wordpress\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=271"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}