What is he best known for?
The fields of study he is best known for:
- Algorithm
- Combinatorics
- Computer network
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 most cited work include:
- When Trees Collide: An Approximation Algorithm for theGeneralized Steiner Problem on Networks (355 citations)
- A Nearly best-possible approximation algorithm for node-weighted Steiner trees (318 citations)
- A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem (234 citations)
What are the main themes of his work throughout his whole career to date?
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.
He most often published in these fields:
- Approximation algorithm (46.11%)
- Combinatorics (40.35%)
- Mathematical optimization (28.24%)
What were the highlights of his more recent work (between 2014-2021)?
- Approximation algorithm (46.11%)
- Mathematical optimization (28.24%)
- Combinatorics (40.35%)
In recent papers he was focusing on the following fields of study:
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.
Between 2014 and 2021, his most popular works were:
- Post Processing Recommender Systems for Diversity (27 citations)
- Robust and MaxMin Optimization under Matroid and Knapsack Uncertainty Sets (24 citations)
- The Performances Analysis of Fast Efficient Lossless Satellite Image Compression and Decompression for Wavelet Based Algorithm (20 citations)
In his most recent research, the most cited papers focused on:
- Algorithm
- Computer network
- Statistics
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
- Vertex together with Shortest-path tree, Minimum spanning tree, Decision tree and Optimal decision,
- Special case which connect with Minimum weight and Polyhedral analysis.
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.
