( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A 4/5 - Approximation Algorithm for the Maximum Traveling Salesman Problem.

, , , и . CoRR, (2015)

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.

Valerian Marcinkowski

Anke Marcinkowski

Frank Marcinkowski

Elisabeth Marcinkowski

Frank Marcinkowski

 

Другие публикации лиц с тем же именем

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