His primary areas of study are Combinatorics, Approximation algorithm, Discrete mathematics, Steiner tree problem and Mathematical optimization. His study on Combinatorics is mostly dedicated to connecting different topics, such as k-minimum spanning tree. The Approximation algorithm study combines topics in areas such as Network planning and design, Graph, Computational complexity theory, Time complexity and Node.
His research integrates issues of Travelling salesman problem and Metric in his study of Discrete mathematics. His Mathematical optimization study combines topics from a wide range of disciplines, such as Algorithm and Small set. His Spanning tree research includes elements of Triangle inequality and Minimum spanning tree.
His scientific interests lie mostly in Approximation algorithm, Combinatorics, Mathematical optimization, Discrete mathematics and Steiner tree problem. His research investigates the link between Approximation algorithm and topics such as Stochastic optimization that cross with problems in Stochastic programming and Vertex cover. His study explores the link between Combinatorics and topics such as Linear programming relaxation that cross with problems in Rounding.
The Discrete mathematics study combines topics in areas such as Online algorithm and Metric. His studies in Steiner tree problem integrate themes in fields like Tree and Algorithm. The concepts of his Spanning tree study are interwoven with issues in Minimum spanning tree and Gomory–Hu tree.
R. Ravi mainly investigates Approximation algorithm, Mathematical optimization, Combinatorics, Discrete mathematics and Computer network. His Approximation algorithm research is multidisciplinary, relying on both Node, Travelling salesman problem, Bipartite graph and Metric space. His work carried out in the field of Mathematical optimization brings together such families of science as Routing, Sequence and Vertex.
His Combinatorics research is multidisciplinary, incorporating elements of Upper and lower bounds, Rounding and Linear programming relaxation. A large part of his Discrete mathematics studies is devoted to Steiner tree problem. The various areas that he examines in his Steiner tree problem study include Covering problems and Online algorithm.
The scientist’s investigation covers issues in Approximation algorithm, Mathematical optimization, Combinatorics, Travelling salesman problem and Artificial intelligence. His Approximation algorithm research includes themes of Graph, Theoretical computer science, Knapsack problem, Combinatorial optimization and Bipartite graph. His Knapsack problem study incorporates themes from Submodular set function, Online algorithm, Matroid and Steiner tree problem.
The study incorporates disciplines such as Metric and Metric space in addition to Mathematical optimization. His research in Combinatorics intersects with topics in Discrete mathematics, Convex combination and Linear programming relaxation. His Travelling salesman problem study also includes fields such as
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
When Trees Collide: An Approximation Algorithm for theGeneralized Steiner Problem on Networks
Ajit Agrawal;Philip Klein;R. Ravi.
SIAM Journal on Computing (1995)
A Nearly best-possible approximation algorithm for node-weighted Steiner trees
Philip N. Klein;R. Ravi.
Journal of Algorithms (1992)
A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem
Naveen Garg;Goran Konjevod;R. Ravi.
Journal of Algorithms (2000)
Spanning Trees---Short or Small
R. Ravi;R. Sundaram;M. V. Marathe;D. J. Rosenkrantz.
SIAM Journal on Discrete Mathematics (1996)
Rapid rumor ramification: approximating the minimum broadcast time
foundations of computer science (1994)
Bicriteria Network Design Problems
Madhav V Marathe;R Ravi;Ravi Sundaram;S.S Ravi.
Journal of Algorithms (1998)
Hedging Uncertainty: Approximation Algorithms for Stochastic Optimization Problems
R. Ravi;Amitabh Sinha.
Mathematical Programming (2006)
A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees
Bang Ye Wu;Giuseppe Lancia;Vineet Bafna;Kun-Mao Chao.
SIAM Journal on Computing (1999)
Boosted sampling: approximation algorithms for stochastic optimization
Anupam Gupta;Martin Pál;R. Ravi;Amitabh Sinha.
symposium on the theory of computing (2004)
Many birds with one stone: multi-objective approximation algorithms
R. Ravi;M. V. Marathe;S. S. Ravi;D. J. Rosenkrantz.
symposium on the theory of computing (1993)
Profile was last updated on December 6th, 2021.
Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).
The ranking h-index is inferred from publications deemed to belong to the considered discipline.
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: