{"id":1108,"date":"2020-09-07T20:33:10","date_gmt":"2020-09-07T20:33:10","guid":{"rendered":"http:\/\/corner.mimuw.edu.pl\/?p=1108"},"modified":"2020-09-07T20:33:10","modified_gmt":"2020-09-07T20:33:10","slug":"igafit-algorithmic-colloquium","status":"publish","type":"post","link":"https:\/\/corner.mimuw.edu.pl\/?p=1108","title":{"rendered":"IGAFIT Algorithmic Colloquium"},"content":{"rendered":"\n<p>We are excited to announce a new online seminar - IGAFIT Algorithmic Colloquium. This new event aims to integrate the European algorithmic community and keep it connected during the times of the pandemic. This online seminar will take&nbsp;place biweekly on Thursday at 14:00 CET, with the talks lasting for 45 minutes. Each talk will be followed by a networking and discussion session on topics related to the talk. We cordially invite all participants to this session. The meeting will be run on&nbsp;<a rel=\"noreferrer noopener\" href=\"https:\/\/www.airmeet.com\/e\/55923fa0-eee9-11ea-8530-b3eab1e75816\" target=\"_blank\">Airmeet<\/a>. More details on the event can be found on&nbsp;<a rel=\"noreferrer noopener\" href=\"http:\/\/igafit.mimuw.edu.pl\/?page_id=483786\" target=\"_blank\">IGAFIT web page<\/a>.<\/p>\n\n\n\n<p>The first talk will be held on the 1st of October 2020.<\/p>\n\n\n\n<p>October 1, 2020<br>Vera Traub, University of Bonn<br>Title: An improved approximation algorithm for ATSP<br>Abstract: In a recent breakthrough, Svensson, Tarnawski, and V\u00e9gh gave the first constant-factor approximation algorithm for the asymmetric traveling salesman problem (ATSP). In this work we revisit their algorithm. While following their overall framework, we improve on each part of it.<\/p>\n\n\n\n<p>Svensson, Tarnawski, and V\u00e9gh perform several steps of reducing ATSP to more and more structured instances. We avoid one of their reduction steps (to irreducible instances) and thus obtain a simpler and much better reduction to vertebrate pairs. Moreover, we show that a slight variant of their algorithm for vertebrate pairs has a much smaller approximation ratio.<\/p>\n\n\n\n<p>Overall we improve the approximation ratio from 506 to 22 + \u03b5 for any \u03b5 &gt; 0. We also improve the upper bound on the integrality ratio of the standard LP relaxation from 319 to 22.<\/p>\n\n\n\n<p>This is joint work with Jens Vygen.<\/p>\n\n\n\n<p>Other upcoming talks include:<\/p>\n\n\n\n<p>October 15, 2020<br>Thatchaphol Saranurak, Toyota Technological Institute at Chicago<br>Title: An almost-linear time deterministic algorithm for expander decomposition<\/p>\n\n\n\n<p>October 29, 2020<br>Nathan Klein, University of Bonn<br>Title: A (Slightly) Improved Approximation Algorithm for Metric TSP<\/p>\n\n\n\n<p>For more details please contact the Organization Committee:<br>Nikhil Bansal<br>Artur Czumaj<br>Andreas Feldmann<br>Adi Ros\u00e9n<br>Eva Rotenberg<br>Piotr Sankowski<br>Christian Sohler&nbsp;<br><\/p>\n","protected":false},"excerpt":{"rendered":"<p>We are excited to announce a new online seminar - IGAFIT Algorithmic Colloquium. This new event aims to integrate the European algorithmic community and keep it connected during the times of the pandemic. This online seminar will take&nbsp;place biweekly on &hellip; <a href=\"https:\/\/corner.mimuw.edu.pl\/?p=1108\">Continue reading <span class=\"meta-nav\">&rarr;<\/span><\/a><\/p>\n","protected":false},"author":3,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_monsterinsights_skip_tracking":false,"_monsterinsights_sitenote_active":false,"_monsterinsights_sitenote_note":"","_monsterinsights_sitenote_category":0,"footnotes":""},"categories":[1],"tags":[],"_links":{"self":[{"href":"https:\/\/corner.mimuw.edu.pl\/index.php?rest_route=\/wp\/v2\/posts\/1108"}],"collection":[{"href":"https:\/\/corner.mimuw.edu.pl\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/corner.mimuw.edu.pl\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/corner.mimuw.edu.pl\/index.php?rest_route=\/wp\/v2\/users\/3"}],"replies":[{"embeddable":true,"href":"https:\/\/corner.mimuw.edu.pl\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=1108"}],"version-history":[{"count":1,"href":"https:\/\/corner.mimuw.edu.pl\/index.php?rest_route=\/wp\/v2\/posts\/1108\/revisions"}],"predecessor-version":[{"id":1109,"href":"https:\/\/corner.mimuw.edu.pl\/index.php?rest_route=\/wp\/v2\/posts\/1108\/revisions\/1109"}],"wp:attachment":[{"href":"https:\/\/corner.mimuw.edu.pl\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=1108"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/corner.mimuw.edu.pl\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=1108"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/corner.mimuw.edu.pl\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=1108"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}