( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Bi-Factor Approximation Algorithms for Hard Capacitated k-Median Problems.

, , , и . SODA, стр. 722-736. SIAM, (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.

Jaroslaw Sotschynskyj

Jaroslaw Slusar

Jaroslaw Tarasiewiecz

Jaroslaw Wodecki

Jaroslaw Malewicz

 

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

New Algorithms for Approximate Nash Equilibria in Bimatrix Games., , и . WINE, том 4858 из Lecture Notes in Computer Science, стр. 17-29. Springer, (2007)Improved Approximation Algorithm for k-level Uncapacitated Facility Location Problem (with Penalties)., , и . Theory Comput. Syst., 58 (1): 19-44 (2016)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., , , , , , и . CoRR, (2022)New results on multi-level aggregation., , , , , , , , , и . Theor. Comput. Sci., (2021)New algorithms for approximate Nash equilibria in bimatrix games., , и . Theor. Comput. Sci., 411 (1): 164-173 (2010)An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem., и . SIAM J. Comput., 39 (6): 2212-2231 (2010)An Improved Approximation for k-median, and Positive Correlation in Budgeted Optimization., , , , и . SODA, стр. 737-756. SIAM, (2015)An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem.. APPROX-RANDOM, том 4627 из Lecture Notes in Computer Science, стр. 29-43. Springer, (2007)Drawing (Complete) Binary Tanglegrams: Hardness, Approximation, Fixed-Parameter Tractability, , , , , , и . Arxiv report, (июня 2008)Available at http://arxiv.org/abs/0806.0920.