( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Tight Bounds for Approximate Carathéodory and Beyond.

, , , и . CoRR, (2015)

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 Fröhlich

S Vinodh

 

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

Power optimization for connectivity problems., , , и . Math. Program., 110 (1): 195-208 (2007)Fault-Tolerant and 3-Dimensional Distributed Topology Control Algorithms in Wireless Multi-hop Networks., , и . Wireless Networks, 12 (2): 179-188 (2006)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)Distributed Graph Algorithmics: Theory and Practice., и . WSDM, стр. 419-420. ACM, (2015)On the Non-progressive Spread of Influence through Social Networks., , , , , и . LATIN, том 7256 из Lecture Notes in Computer Science, стр. 315-326. Springer, (2012)Fully Dynamic Matching: Beating 2-Approximation in Δε Update Time., , и . CoRR, (2019)Market sharing games applied to content distribution in ad hoc networks., , , и . IEEE J. Sel. Areas Commun., 24 (5): 1020-1033 (2006)Coordination Mechanisms for Weighted Sum of Completion Times in Machine Scheduling, , и . CoRR, (2010)