{"619186":{"#nid":"619186","#data":{"type":"event","title":"ARC Lecture Series: Ola Svensson (EPFL)","body":[{"value":"\u003Cp align=\u0022center\u0022\u003E\u003Cstrong\u003EBreakthroughs in Approximation Algorithms for\u003Cbr \/\u003E\r\nTraveling Salesman Problems (TSP)\u0026nbsp;\u003C\/strong\u003E\u003Cbr \/\u003E\r\nLecture series by\u0026nbsp;\u003Ca href=\u0022https:\/\/theory.epfl.ch\/osven\/\u0022\u003EOla Svensson (EPFL)\u003C\/a\u003E\u003Cbr \/\u003E\r\nTuesday, April 23 - Thursday, April 25, 2019\u003Cbr \/\u003E\r\n10am - noon daily in Groseclose 402\u003C\/p\u003E\r\n\r\n\u003Cp\u003E\u003Cbr \/\u003E\r\n\u003Cstrong\u003E\u003Cem\u003ESchedule:\u003C\/em\u003E\u003C\/strong\u003E\u003C\/p\u003E\r\n\r\n\u003Cp\u003E\u003Cem\u003ETuesday, April 23, 2019\u003C\/em\u003E\u003C\/p\u003E\r\n\r\n\u003Cp\u003E10:00am - 12:00pm\u0026nbsp;\u0026nbsp;\u0026nbsp; Lecture 1: The symmetric TSP (Groseclose 402)\u003Cbr \/\u003E\r\n12:00pm - 1:00pm \u0026nbsp; \u0026nbsp;\u0026nbsp; Lunch\u003Cbr \/\u003E\r\n3:30pm - 4:00pm\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp; Problem Solving Session (Klaus 2222)\u003C\/p\u003E\r\n\r\n\u003Cp\u003E\u003Cem\u003EWednesday, April 24, 2019\u003C\/em\u003E\u003C\/p\u003E\r\n\r\n\u003Cp\u003E10:00am - 12:00pm\u0026nbsp;\u0026nbsp;\u0026nbsp; Lecture 2: \u0026nbsp;Different approaches for asymmetric TSP (Groseclose 402)\u003Cbr \/\u003E\r\n12:00pm - 1:00pm\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp; Lunch\u0026nbsp;\u0026amp; Poster Session\u003Cbr \/\u003E\r\n3:30pm - 4:00pm\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp; Problem Solving Session (Klaus 2222)\u003C\/p\u003E\r\n\r\n\u003Cp\u003E\u003Cem\u003EThursday, April 25, 2019\u003C\/em\u003E\u003C\/p\u003E\r\n\r\n\u003Cp\u003E10:00am - 12:00pm\u0026nbsp;\u0026nbsp;\u0026nbsp; Lecture 3: A constant-factor approximation algorithm for asymmetric TSP (Groseclose 402)\u003Cbr \/\u003E\r\n12:00pm - 1:00pm\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp; Lunch\u003Cbr \/\u003E\r\n3:30pm - 4:00pm\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp; Problem Solving Session (Klaus 2222)\u003C\/p\u003E\r\n\r\n\u003Cp\u003E\u0026nbsp;\u003C\/p\u003E\r\n\r\n\u003Cp\u003E\u003Cstrong\u003EAbstract:\u0026nbsp;\u0026nbsp;\u003C\/strong\u003EThe traveling salesman problem is one of the most fundamental optimization problems. Given n cities and pairwise distances, it is the problem of finding a tour of minimum distance that visits each city once. In spite of significant research efforts, current techniques seem insufficient for settling the approximability of the traveling salesman problem.\u0026nbsp; This status is particularly intriguing as a natural and several-decade-old linear programming relaxation is believed to give better guarantees than we are currently able to prove!\u003C\/p\u003E\r\n\r\n\u003Cp\u003EIn this mini-course, we will overview of old and new approaches for settling this question. We shall, in particular, talk about recent developments for the asymmetric traveling salesman problem.\u003C\/p\u003E\r\n\r\n\u003Cp\u003E\u003Cstrong\u003EBio:\u0026nbsp;\u0026nbsp;\u003C\/strong\u003EOla Svensson is an Associate Professor at the School of Computer and Communication Sciences at EPFL, Switzerland.\u0026nbsp; He is interested in theoretical aspects of computer science with an emphasis on the approximability of NP-hard optimization problems. His work has received several recognitions including the 2019 Michael and Sheila Held Prize by the National Academy of Sciences and best paper awards at FOCS and STOC\u003Cstrong\u003E. \u0026nbsp;\u003C\/strong\u003E\u003C\/p\u003E\r\n\r\n\u003Cp\u003E----------------------------------\u003C\/p\u003E\r\n\r\n\u003Cp\u003E\u003Ca href=\u0022https:\/\/theory.epfl.ch\/osven\/\u0022\u003ESpeaker\u0026#39;s Webpage\u003C\/a\u003E\u003C\/p\u003E\r\n\r\n\u003Cp\u003E\u003Cem\u003EVideos of recent talks are available at: \u003C\/em\u003E\u003Ca href=\u0022https:\/\/smartech.gatech.edu\/handle\/1853\/46836\u0022\u003E\u003Cem\u003Ehttps:\/\/smartech.gatech.edu\/handle\/1853\/46836\u003C\/em\u003E\u003C\/a\u003E\u003C\/p\u003E\r\n\r\n\u003Cp\u003E\u003Ca href=\u0022https:\/\/mailman.cc.gatech.edu\/mailman\/listinfo\/arc-colloq\u0022\u003E\u003Cem\u003EClick here to subscribe to the seminar email list: arc-colloq@cc.gatech.edu \u003C\/em\u003E\u003C\/a\u003E\u003C\/p\u003E","summary":null,"format":"limited_html"}],"field_subtitle":"","field_summary":"","field_summary_sentence":[{"value":"Breakthroughs in Approximation Algorithms for Traveling Salesman Problems (TSP)  - Groseclose 402"}],"uid":"27544","created_gmt":"2019-03-13 15:04:01","changed_gmt":"2019-04-01 00:55:36","author":"Francella Tonge","boilerplate_text":"","field_publication":"","field_article_url":"","field_event_time":{"event_time_start":"2019-04-23T11:00:00-04:00","event_time_end":"2019-04-25T14:00:00-04:00","event_time_end_last":"2019-04-25T14:00:00-04:00","gmt_time_start":"2019-04-23 15:00:00","gmt_time_end":"2019-04-25 18:00:00","gmt_time_end_last":"2019-04-25 18:00:00","rrule":null,"timezone":"America\/New_York"},"extras":[],"groups":[{"id":"70263","name":"ARC"}],"categories":[],"keywords":[],"core_research_areas":[],"news_room_topics":[],"event_categories":[{"id":"1795","name":"Seminar\/Lecture\/Colloquium"}],"invited_audience":[{"id":"78761","name":"Faculty\/Staff"},{"id":"177814","name":"Postdoc"},{"id":"78771","name":"Public"},{"id":"174045","name":"Graduate students"},{"id":"78751","name":"Undergraduate students"}],"affiliations":[],"classification":[],"areas_of_expertise":[],"news_and_recent_appearances":[],"phone":[],"contact":[],"email":[],"slides":[],"orientation":[],"userdata":""}}}