( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Approximating the Norms of Graph Spanners.

, , и . APPROX-RANDOM, том 145 из LIPIcs, стр. 11:1-11:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)

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.

Hugo Eden

Werner Eden

Klaus Eden

Carsten Eden

Eden Volohonsky

 

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

Approximating Spanners and Directed Steiner Forest: Upper and Lower Bounds., , , и . ACM Trans. Algorithms, 16 (3): 33:1-33:31 (2020)Lift-and-Project Methods for Set Cover and Knapsack., , и . Algorithmica, 80 (12): 3920-3942 (2018)Lift-and-Project Methods for Set Cover and Knapsack., , и . WADS, том 8037 из Lecture Notes in Computer Science, стр. 256-267. Springer, (2013)Approximation Algorithms for Label Cover and The Log-Density Threshold., , , и . SODA, стр. 900-919. SIAM, (2017)The Norms of Graph Spanners., , и . ICALP, том 132 из LIPIcs, стр. 40:1-40:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Lowest-Degree k-Spanner: Approximation and Hardness., и . Theory Comput., 12 (1): 1-29 (2016)Understanding Set Cover: Sub-exponential Time Approximations and Lift-and-Project Methods, , и . CoRR, (2012)Approximating Red-Blue Set Cover., , и . CoRR, (2023)Approximating the Norms of Graph Spanners., , и . APPROX-RANDOM, том 145 из LIPIcs, стр. 11:1-11:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Lowest Degree k-Spanner: Approximation and Hardness., и . APPROX-RANDOM, том 28 из LIPIcs, стр. 80-95. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2014)