( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
To Close Is Easier Than To Open: Dual Parameterization To k-Median.

, , , , и . WAOA, том 12806 из Lecture Notes in Computer Science, стр. 113-126. Springer, (2020)

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.

Jaroslaw Tarasiewiecz

Jaroslaw Wodecki

Jaroslaw Malewicz

Jaroslaw Sotschynskyj

Jaroslaw Slusar

 

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

An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem.. APPROX-RANDOM, том 4627 из Lecture Notes in Computer Science, стр. 29-43. Springer, (2007)An Improved Approximation for k-median, and Positive Correlation in Budgeted Optimization., , , , и . SODA, стр. 737-756. SIAM, (2015)Improved Approximation Algorithm for k-level Uncapacitated Facility Location Problem (with Penalties)., , и . Theory Comput. Syst., 58 (1): 19-44 (2016)New Algorithms for Approximate Nash Equilibria in Bimatrix Games., , и . WINE, том 4858 из Lecture Notes in Computer Science, стр. 17-29. Springer, (2007)Better Bounds for Online Line Chasing., , , , , и . MFCS, том 138 из LIPIcs, стр. 8:1-8:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)An O(loglog n)-Approximation for Submodular Facility Location., , , , , , и . ICALP, том 297 из LIPIcs, стр. 5:1-5:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Drawing (Complete) Binary Tanglegrams: Hardness, Approximation, Fixed-Parameter Tractability, , , , , , и . Arxiv report, (июня 2008)Available at http://arxiv.org/abs/0806.0920.Improved LP-Rounding Approximation Algorithm for k-level Uncapacitated Facility Location., и . ICALP (1), том 7391 из Lecture Notes in Computer Science, стр. 157-169. Springer, (2012)Approximating Node-Weighted k-MST on Planar Graphs., , и . Theory Comput. Syst., 64 (4): 626-644 (2020)The approximation gap for the metric facility location problem is not yet closed., и . Oper. Res. Lett., 35 (3): 379-384 (2007)