( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Improved approximations for Euclidean k-means and k-median, via nested quasi-independent sets.

, , , и . STOC, стр. 1621-1628. ACM, (2022)

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.

Vahab Pournaghshband

Abbas Vahabzadeh

S Danischewski

S Ulrich

S Hilt

 

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

On the Non-progressive Spread of Influence through Social Networks., , , , , и . LATIN, том 7256 из Lecture Notes in Computer Science, стр. 315-326. Springer, (2012)Distributed Graph Algorithmics: Theory and Practice., и . WSDM, стр. 419-420. ACM, (2015)Connected Components in MapReduce and Beyond., , , , и . SoCC, стр. 18:1-18:13. ACM, (2014)Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions., , и . EC, стр. 70-77. ACM, (2008)Non-monotone submodular maximization under matroid and knapsack constraints., , , и . STOC, стр. 323-332. ACM, (2009)Online Optimization for Markets and the Cloud: Theory and Practice.. SIGMETRICS (Abstracts), стр. 47-48. ACM, (2017)Almost Tight Approximation Algorithms for Explainable Clustering., , и . SODA, стр. 2641-2663. SIAM, (2022)A Data-Driven Metric of Incentive Compatibility., , , и . WWW, стр. 1796-1806. ACM / IW3C2, (2020)Optimal marketing strategies over social networks., , и . WWW, стр. 189-198. ACM, (2008)Trust-based recommendation systems: an axiomatic approach., , , , , , , и . WWW, стр. 199-208. ACM, (2008)