From post

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.

 

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

Approximation Algorithms for k-Line Center., , и . ESA, том 2461 из Lecture Notes in Computer Science, стр. 54-63. Springer, (2002)Computing Regions Decomposable into m Stars., , и . ESA, том 8737 из Lecture Notes in Computer Science, стр. 480-491. Springer, (2014)Reductions among high dimensional proximity problems., , и . SODA, стр. 769-778. ACM/SIAM, (2001)Optimally Decomposing Coverings with Translates of a Convex Polygon., и . Discret. Comput. Geom., 46 (2): 313-333 (2011)A (1+)-approximation algorithm for 2-line-center., , и . Comput. Geom., 26 (2): 119-128 (2003)Computing Equilibrium Prices: Does Theory Meet Practice?., , , и . ESA, том 3669 из Lecture Notes in Computer Science, стр. 83-94. Springer, (2005)Capacitated Sum-Of-Radii Clustering: An FPT Approximation., и . ESA, том 173 из LIPIcs, стр. 62:1-62:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)A Constant Approximation for Colorful k-Center., , , и . ESA, том 144 из LIPIcs, стр. 12:1-12:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)No Coreset, No Cry: II., и . FSTTCS, том 3821 из Lecture Notes in Computer Science, стр. 107-115. Springer, (2005)On the polynomial time computation of equilibria for certain exchange economies, , и . SODA, стр. 72-81. SIAM, (2005)