( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Capacitated Vehicle Routing with Non-uniform Speeds.

, , , и . IPCO, том 6655 из Lecture Notes in Computer Science, стр. 235-247. Springer, (2011)

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.

Fausto Ravida

Samatha Ravipati

Somasundaram Ravindran

Mylapore Ravi

Jewgeni Ravik

 

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

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)A new system-wide diversity measure for recommendations with efficient algorithms., , и . CoRR, (2018)Sort-Cut: A Pareto Optimal and Semi-Truthful Mechanism for Multi-Unit Auctions with Budget-Constrained Bidders, , и . CoRR, (2009)Approximation Through Local Optimality: Designing Networks with Small Degree., , и . FSTTCS, том 652 из Lecture Notes in Computer Science, стр. 279-290. Springer, (1992)Randomized Approximation Algorithms for Query Optimization Problems on Two Processors., , и . ESA, том 2461 из Lecture Notes in Computer Science, стр. 649-661. Springer, (2002)On Two-Stage Stochastic Minimum Spanning Trees., , и . IPCO, том 3509 из Lecture Notes in Computer Science, стр. 321-334. Springer, (2005)Delegate and Conquer: An LP-Based Approximation Algorithm for Minimum Degree MSTs., и . ICALP (1), том 4051 из Lecture Notes in Computer Science, стр. 169-180. Springer, (2006)Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design., , и . SIAM J. Comput., 44 (5): 1202-1229 (2015)Optimal Circuits for Parallel Multipliers., , , и . IEEE Trans. Computers, 47 (3): 273-285 (1998)