( en | de | ru )

 

Disambiguation of "Chlamtác, Eden"

Author of the publication

copydeleteadd this publication to your clipboard
How to Cut a Ball Without Separating: Improved Approximations for Length Bounded Cut.

, and . APPROX-RANDOM, volume 176 of LIPIcs, page 41:1-41:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (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. You can also use the button next to the name to display some publications already assigned to the person.

Hugo Eden

Werner Eden

Carsten Eden

Eden Volohonsky

Klaus Eden

 

Other publications of authors with the same name

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