{"id":358,"date":"2013-11-08T17:31:55","date_gmt":"2013-11-08T17:31:55","guid":{"rendered":"http:\/\/www.cs.uleth.ca\/~benkoczi\/wordpress\/?p=358"},"modified":"2014-10-13T03:22:08","modified_gmt":"2014-10-13T03:22:08","slug":"schedule-for-presentations","status":"publish","type":"post","link":"https:\/\/www.cs.uleth.ca\/~benkoczi\/wordpress\/?p=358","title":{"rendered":"Schedule for presentations"},"content":{"rendered":"

Farshad Barahimi: Tue Nov 19, 1:40 PM<\/strong>: Shortest superstring problem.
\nA. Golovnev, A.S. Kulikov, and I. Mihajlin, Approximating Shortest Superstring Problem Using de Bruijn Graphs. In CPM 2013, Lect. Notes Comput. Sci. 7922:120\u2013129, 2013.
\n[paper]<\/a>
\n[presentation]<\/a><\/p>\n

Regular lecture: Tue Nov 19, 2:20 PM<\/strong>.<\/p>\n

Mark Thom: Thr Nov 21, 1:40 PM <\/strong>: Canadian traveller problem.
\nLiao, Chung-Shou, and Yamming Huang. “Generalized Canadian traveller problems.” Journal of Combinatorial Optimization (2013): 1-12.
\n[paper]<\/a><\/p>\n

Jayati Law: Thr Nov 21, 2:20 PM <\/strong>: A PTAS for the max-colouring problem in trees.
\nPemmaraju, Sriram V., and Rajiv Raman. “Approximation algorithms for the max-coloring problem.” Automata, languages and programming. Springer Berlin Heidelberg, 2005. 1064-1075.
\n[paper]<\/a>
\n[presentation]<\/a><\/p>\n

Farnoush Davoodi: Tue Nov 26, 1:40 PM <\/strong>: Greedy algorithms for the minimum knapsack problem.
\nJ. Csirik, J. B. G. Frenk, M. Labbe, and S. Zhang. Heuristics for the 0-1 min-knapsack \u00b4 problem. Acta Cybernetica, 10(1-2):15-20, 1991.
\n[paper]<\/a>
\n[presentation]<\/a><\/p>\n

Jahan Kawsar: Tue Nov 26, 2:20 PM <\/strong>: Primal-dual algorithm for the minimum knapsack problem.
\nSection 7.5 in the text.<\/p>\n

Mohammad Akbari: Thr Nov 28, 1:40 PM <\/strong>: Asymmetric TSP.
\n“Frieze, A.M., Galbiati, G., and Maffioli, F. [1982]: On the worst-case performance of some algorithms for the asymmetric traveling salesman problem. Networks 12 (1982), 23\u201339”.
\n[paper]<\/a><\/p>\n

Sina Golestanirad: Tue Nov 28, 2:20 PM<\/strong>: Partial set cover.
\nCovering Analysis of the Greedy Algorithm for Partial Cover, Tapio Elomaa and Jussi Kujala, LNCS 6060, pp. 102-113, 2010.
\n[paper]<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"

Farshad Barahimi: Tue Nov 19, 1:40 PM: Shortest superstring problem. A. Golovnev, A.S. Kulikov, and I. Mihajlin, Approximating Shortest Superstring Problem Using de Bruijn Graphs. In CPM 2013, Lect. Notes Comput. Sci. 7922:120\u2013129, 2013. [paper] [presentation] Regular lecture: Tue Nov … Continue reading →<\/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-358","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\/358","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=358"}],"version-history":[{"count":14,"href":"https:\/\/www.cs.uleth.ca\/~benkoczi\/wordpress\/index.php?rest_route=\/wp\/v2\/posts\/358\/revisions"}],"predecessor-version":[{"id":436,"href":"https:\/\/www.cs.uleth.ca\/~benkoczi\/wordpress\/index.php?rest_route=\/wp\/v2\/posts\/358\/revisions\/436"}],"wp:attachment":[{"href":"https:\/\/www.cs.uleth.ca\/~benkoczi\/wordpress\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=358"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.cs.uleth.ca\/~benkoczi\/wordpress\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=358"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.cs.uleth.ca\/~benkoczi\/wordpress\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=358"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}