What is he best known for?
The fields of study he is best known for:
- Combinatorics
- Computer network
- Algorithm
The scientist’s investigation covers issues in Combinatorics, Discrete mathematics, Approximation algorithm, Mathematical optimization and Knapsack problem.
His Combinatorics study integrates concerns from other disciplines, such as Generalized assignment problem, Group and Greedy algorithm.
His Discrete mathematics study frequently links to other fields, such as Submodular set function.
His Submodular set function study incorporates themes from Function and Subject.
His study in Approximation algorithm is interdisciplinary in nature, drawing from both Metric, Time complexity, Computational complexity theory, Minimax approximation algorithm and Linear programming.
His Mathematical optimization research incorporates elements of Algorithm, Scheduling and Single-machine scheduling.
His most cited work include:
- Maximizing a Monotone Submodular Function Subject to a Matroid Constraint (550 citations)
- Incremental clustering and dynamic information retrieval (328 citations)
- Approximation Algorithms for Directed Steiner Problems (313 citations)
What are the main themes of his work throughout his whole career to date?
His scientific interests lie mostly in Combinatorics, Discrete mathematics, Approximation algorithm, Mathematical optimization and Linear programming relaxation.
His research combines Upper and lower bounds and Combinatorics.
His Discrete mathematics research is multidisciplinary, relying on both Network planning and design and Multi-commodity flow problem.
His Approximation algorithm study also includes
- Knapsack problem, which have a strong connection to Randomized rounding,
- Graph that connect with fields like Binary logarithm.
In his research on the topic of Linear programming relaxation, Vertex is strongly related with Minimum cut.
His studies in Submodular set function integrate themes in fields like Matroid and Greedy algorithm.
He most often published in these fields:
- Combinatorics (64.19%)
- Discrete mathematics (46.72%)
- Approximation algorithm (40.61%)
What were the highlights of his more recent work (between 2015-2021)?
- Combinatorics (64.19%)
- Discrete mathematics (46.72%)
- Approximation algorithm (40.61%)
In recent papers he was focusing on the following fields of study:
Chandra Chekuri mostly deals with Combinatorics, Discrete mathematics, Approximation algorithm, Linear programming relaxation and Randomized algorithm.
Chandra Chekuri brings together Combinatorics and Cardinality to produce work in his papers.
He works in the field of Discrete mathematics, namely Directed graph.
His work on Vertex cover as part of general Approximation algorithm study is frequently linked to Generalization, bridging the gap between disciplines.
His Linear programming relaxation study combines topics in areas such as Dynamic programming, Combinatorial algorithms and Spanning tree.
The concepts of his Randomized algorithm study are interwoven with issues in Randomized rounding, Upper and lower bounds, Deterministic algorithm and Knapsack problem.
Between 2015 and 2021, his most popular works were:
- Polynomial Bounds for the Grid-Minor Theorem (41 citations)
- Submodular function maximization in parallel via the multilinear relaxation (27 citations)
- Parallelizing greedy for submodular set function maximization in matroids and beyond (16 citations)
In his most recent research, the most cited papers focused on:
- Computer network
- Combinatorics
- Algorithm
His primary areas of investigation include Combinatorics, Randomized algorithm, Discrete mathematics, Linear programming relaxation and Minimum cut.
In his study, which falls under the umbrella issue of Combinatorics, Multi-commodity flow problem and Algorithm is strongly linked to Relaxation.
His Randomized algorithm research is multidisciplinary, incorporating perspectives in Randomized rounding, Deterministic algorithm and Knapsack problem.
Chandra Chekuri studies Treewidth which is a part of Discrete mathematics.
His biological study spans a wide range of topics, including Approximation algorithm and Spanning tree.
His research investigates the connection with Minimum cut and areas like Hypergraph which intersect with concerns in Binary logarithm, Representation, Adjacency list and Vertex.
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.
