What is he best known for?
The fields of study he is best known for:
- Algorithm
- Combinatorics
- Discrete mathematics
His primary areas of study are Discrete mathematics, Algorithm, Combinatorics, Dominating set and Approximation algorithm.
The concepts of his Algorithm study are interwoven with issues in Binary logarithm and Measure.
The various areas that he examines in his Measure study include Upper and lower bounds, Bounded function and Backtracking.
His Combinatorics study combines topics in areas such as k-minimum spanning tree and Single node.
His Dominating set research incorporates elements of Improved algorithm, Graph theory, Ordered set and Exact algorithm.
Fabrizio Grandoni has researched Approximation algorithm in several fields, including Randomized algorithm, Combinatorial optimization, Matroid and Steiner tree problem.
His most cited work include:
- An improved LP-based approximation for steiner tree (241 citations)
- A measure & conquer approach for the analysis of exact algorithms (201 citations)
- Steiner Tree Approximation via Iterative Randomized Rounding (163 citations)
What are the main themes of his work throughout his whole career to date?
His primary scientific interests are in Combinatorics, Discrete mathematics, Approximation algorithm, Algorithm and Mathematical optimization.
His study in Discrete mathematics is interdisciplinary in nature, drawing from both k-minimum spanning tree and Graph.
His Approximation algorithm research is multidisciplinary, relying on both Network planning and design, Combinatorial optimization and Steiner tree problem.
The Algorithm study combines topics in areas such as Measure, Upper and lower bounds and Bounded function.
In the subject of general Mathematical optimization, his work in Optimization problem, Minimum-cost flow problem and Flow network is often linked to Bandwidth allocation, thereby combining diverse domains of study.
The study incorporates disciplines such as Graph theory and Exact algorithm in addition to Dominating set.
He most often published in these fields:
- Combinatorics (50.99%)
- Discrete mathematics (39.07%)
- Approximation algorithm (38.41%)
What were the highlights of his more recent work (between 2018-2021)?
- Combinatorics (50.99%)
- Approximation algorithm (38.41%)
- Algorithm (23.18%)
In recent papers he was focusing on the following fields of study:
Fabrizio Grandoni mostly deals with Combinatorics, Approximation algorithm, Algorithm, Reduction and Constant.
His research integrates issues of Bounded function and Knapsack problem in his study of Combinatorics.
His studies deal with areas such as Tree, Discrete mathematics, Steiner tree problem and Interval as well as Approximation algorithm.
Particularly relevant to Graph is his body of work in Discrete mathematics.
His Algorithm research is multidisciplinary, incorporating elements of Degree and Conjecture.
His work carried out in the field of Reduction brings together such families of science as Cover and Graph.
Between 2018 and 2021, his most popular works were:
- Oblivious dimension reduction for k-means: beyond subspaces and the Johnson-Lindenstrauss lemma (17 citations)
- Dynamic set cover: improved algorithms and lower bounds (15 citations)
- O(log2k / log log k)-approximation algorithm for directed Steiner tree: a tight quasi-polynomial-time algorithm (14 citations)
In his most recent research, the most cited papers focused on:
- Algorithm
- Combinatorics
- Time complexity
His main research concerns Combinatorics, Graph, Approximation algorithm, Algorithm and Matching.
In his works, Fabrizio Grandoni undertakes multidisciplinary study on Combinatorics and High probability.
Tree, Network planning and design and Discrete mathematics is closely connected to Reduction in his research, which is encompassed under the umbrella topic of Graph.
His Approximation algorithm study combines topics from a wide range of disciplines, such as Tree and Steiner tree problem.
He combines subjects such as Cardinality and Upper and lower bounds with his study of Algorithm.
He has included themes like Dynamic problem, Set cover problem, Complement and Randomized algorithm in his Upper and lower bounds study.
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.
