( en | de | ru )

 

Disambiguation of "Ravi, R."

Author of the publication

copydeleteadd this publication to your clipboard
Delegate and Conquer: An LP-Based Approximation Algorithm for Minimum Degree MSTs.

, and . ICALP (1), volume 4051 of Lecture Notes in Computer Science, page 169-180. Springer, (2006)

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

Approximating Maximum Leaf Spanning Trees in Almost Linear Time., and . J. Algorithms, 29 (1): 132-141 (1998)An approximation algorithm for the covering Steiner problem., and . SODA, page 338-344. ACM/SIAM, (2000)Haplotyping for Disease Association: A Combinatorial Approach, , and . IEEE/ACM Transactions on Computational Biology and Bioinformatics, 5 (2): 245-251 (2008)Quasi-polynomial Time Approximation Algorithm for Low-Degree Minimum-Cost Steiner Trees., and . FSTTCS, volume 2914 of Lecture Notes in Computer Science, page 289-301. Springer, (2003)Matching Based Augmentations for Approximating Connectivity Problems.. LATIN, volume 3887 of Lecture Notes in Computer Science, page 13-24. Springer, (2006)The Constrained Minimum Spanning Tree Problem (Extended Abstract)., and . SWAT, volume 1097 of Lecture Notes in Computer Science, page 66-75. Springer, (1996)A New Bound for the 2-Edge Connected Subgraph Problem., and . IPCO, volume 1412 of Lecture Notes in Computer Science, page 112-125. Springer, (1998)Approximation Algorithms for a Capacitated Network Design Problem., , and . Algorithmica, 38 (3): 417-431 (2004)An intelligent approach based on neuro-fuzzy detachment scheme for preventing jamming attack in wireless networks., , and . J. Intell. Fuzzy Syst., 28 (2): 809-820 (2015)A simple proof of the Moore-Hodgson Algorithm for minimizing the number of late jobs., , and . Oper. Res. Lett., 49 (6): 842-843 (2021)