( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Errata for \.

, , , , , и . Proc. VLDB Endow., 17 (4): 643 (декабря 2023)

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.

Claire Eschbach

Claire Hunkeler

Claire Kieser

Claire Monteleoni

Claire Ingram

 

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

A quasi-polynomial time approximation scheme for Euclidean capacitated vehicle routing, и . CoRR, (2008)Sherali-adams relaxations of the matching polytope., и . STOC, стр. 293-302. ACM, (2009)Hierarchical Clustering: Objective Functions and Algorithms., , , и . J. ACM, 66 (4): 26:1-26:42 (2019)Large Very Dense Subgraphs in a Stream of Edges., и . FODS, стр. 107-117. ACM, (2020)Approximating Maximum Integral Multiflows on Bounded Genus Graphs., , , и . ICALP, том 198 из LIPIcs, стр. 80:1-80:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Unsplittable Euclidean Capacitated Vehicle Routing: A (2+ε)-Approximation Algorithm., , и . ITCS, том 251 из LIPIcs, стр. 63:1-63:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)The Unreasonable Success of Local Search: Geometric Optimization., и . CoRR, (2014)Huffman Coding with Letter Costs: A Linear-Time Approximation Scheme., , и . SIAM J. Comput., 41 (3): 684-713 (2012)Improved Approximation Algorithms for Budgeted Allocations., , , , и . ICALP (1), том 5125 из Lecture Notes in Computer Science, стр. 186-197. Springer, (2008)On popularity-based random matching markets., , и . CoRR, (2019)