Author of the publication

A 4/5 - Approximation Algorithm for the Maximum Traveling Salesman Problem.

, , , and . IPCO, volume 10328 of Lecture Notes in Computer Science, page 173-185. Springer, (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Tight Inapproximability of Minimum Maximal Matching on Bipartite Graphs and Related Problems., , and . WAOA, volume 12982 of Lecture Notes in Computer Science, page 48-64. Springer, (2021)Constant-Factor FPT Approximation for Capacitated k-Median., , , , and . ESA, volume 144 of LIPIcs, page 1:1-1:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)A 4/5 - Approximation Algorithm for the Maximum Traveling Salesman Problem., , , and . CoRR, (2015)Tight Approximation Ratio for Minimum Maximal Matching., , and . CoRR, (2018)Tight Approximation for Proportional Approval Voting., , , and . IJCAI, page 276-282. ijcai.org, (2020)Scheduled for July 2020, Yokohama, Japan, postponed due to the Corona pandemic..Tight Approximation Ratio for Minimum Maximal Matching., , and . IPCO, volume 11480 of Lecture Notes in Computer Science, page 181-193. Springer, (2019)A 4/5 - Approximation Algorithm for the Maximum Traveling Salesman Problem., , , and . IPCO, volume 10328 of Lecture Notes in Computer Science, page 173-185. Springer, (2017)Online Facility Location with Linear Delay., , , and . APPROX/RANDOM, volume 245 of LIPIcs, page 45:1-45:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)To Close Is Easier Than To Open: Dual Parameterization To k-Median., , , , and . WAOA, volume 12806 of Lecture Notes in Computer Science, page 113-126. Springer, (2020)