( en | de | ru )

 

Disambiguation of "Ravi, R."

Author of the publication

copydeleteadd this publication to your clipboard
Timeliness Through Telephones: Approximating Information Freshness in Vector Clock Models.

, , , , and . SODA, page 2411-2428. SIAM, (2023)

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. You can also use the button next to the name to display some publications already assigned to the person.

Samatha Ravipati

Fausto Ravida

Somasundaram Ravindran

Mylapore Ravi

Holger Raviol

 

Other publications of authors with the same name

Buy-at-Bulk Network Design: Approximating the Single-Sink Edge Installation Problem., , , and . SODA, page 619-628. ACM/SIAM, (1997)We know who you followed last summer: inferring social link creation times in twitter., , , , , and . WWW, page 517-526. ACM, (2011)Redeeming Nested Dissection: Parallelism Implies Fill., , , and . PPSC, (1999)Approximating k-cuts via network strength., and . SODA, page 621-622. ACM/SIAM, (2002)When cycles collapse: A general approximation technique for constrained two-connectivity problems., and . IPCO, page 39-55. CIACO, (1993)Pay Today for a Rainy Day: Improved Approximation Algorithms for Demand-Robust Min-Cut and Shortest Path Problems., , and . STACS, volume 3884 of Lecture Notes in Computer Science, page 206-217. Springer, (2006)Deliver or hold: Approximation Algorithms for the Periodic Inventory Routing Problem., , and . APPROX-RANDOM, volume 28 of LIPIcs, page 209-225. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2014)Minimum Vehicle Routing with a Common Deadline., and . APPROX-RANDOM, volume 4110 of Lecture Notes in Computer Science, page 212-223. Springer, (2006)Optimal Decision Tree with Noisy Outcomes., , , and . NeurIPS, page 3298-3308. (2019)On the Integrality Gap of a Natural Formulation of the Single-Sink Buy-at-Bulk Network Design Problem., , , , , and . IPCO, volume 2081 of Lecture Notes in Computer Science, page 170-184. Springer, (2001)