( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Profit guaranteeing mechanisms for multicast networks.

, , , , и . EC, стр. 190-191. ACM, (2003)

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.

Samatha Ravipati

Fausto Ravida

Somasundaram Ravindran

Holger Raviol

Jewgeni Ravik

 

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

Redeeming Nested Dissection: Parallelism Implies Fill., , , и . PPSC, (1999)Approximating k-cuts via network strength., и . SODA, стр. 621-622. ACM/SIAM, (2002)When cycles collapse: A general approximation technique for constrained two-connectivity problems., и . IPCO, стр. 39-55. CIACO, (1993)We know who you followed last summer: inferring social link creation times in twitter., , , , , и . WWW, стр. 517-526. ACM, (2011)Buy-at-Bulk Network Design: Approximating the Single-Sink Edge Installation Problem., , , и . SODA, стр. 619-628. ACM/SIAM, (1997)Randomized Approximation Algorithms for Query Optimization Problems on Two Processors., , и . ESA, том 2461 из Lecture Notes in Computer Science, стр. 649-661. Springer, (2002)Inventory Routing Problem with Facility Location., и . WADS, том 11646 из Lecture Notes in Computer Science, стр. 452-465. Springer, (2019)Approximation Through Local Optimality: Designing Networks with Small Degree., , и . FSTTCS, том 652 из Lecture Notes in Computer Science, стр. 279-290. Springer, (1992)Line-of-Sight Networks., , , и . Comb. Probab. Comput., 18 (1-2): 145-163 (2009)Delegate and Conquer: An LP-Based Approximation Algorithm for Minimum Degree MSTs., и . ICALP (1), том 4051 из Lecture Notes in Computer Science, стр. 169-180. Springer, (2006)