What is she best known for?
The fields of study she is best known for:
- Algorithm
- Artificial intelligence
- Mathematical optimization
Dorit S. Hochbaum mainly investigates Discrete mathematics, Combinatorics, Mathematical optimization, Algorithm and Approximation algorithm.
Her Discrete mathematics research is multidisciplinary, incorporating perspectives in Integer programming and Packing problems.
In general Combinatorics, her work in Edge cover, Vertex cover, Independent set and Complete bipartite graph is often linked to Convex optimization linking many areas of study.
Her study on Mathematical optimization is mostly dedicated to connecting different topics, such as Time complexity.
Her Algorithm research includes elements of Binary logarithm and Heuristic.
Her research investigates the connection with Approximation algorithm and areas like Optimization problem which intersect with concerns in Branch and price, Special ordered set, Segmentation and Image segmentation.
Her most cited work include:
- A Best Possible Heuristic for the k-Center Problem (733 citations)
- Approximation schemes for covering and packing problems in image processing and VLSI (667 citations)
- Using dual approximation algorithms for scheduling problems theoretical and practical results (628 citations)
What are the main themes of her work throughout her whole career to date?
Dorit S. Hochbaum focuses on Mathematical optimization, Combinatorics, Time complexity, Discrete mathematics and Algorithm.
In the field of Mathematical optimization, her study on Heuristics, Greedy algorithm and Minimum-cost flow problem overlaps with subjects such as Nonlinear programming and Job shop scheduling.
Her Approximation algorithm, Vertex cover and Edge cover study in the realm of Combinatorics connects with subjects such as Convex optimization.
She focuses mostly in the field of Time complexity, narrowing it down to matters related to Image segmentation and, in some cases, Cluster analysis.
She has included themes like Set packing, Covering problems, Integer programming and co-NP-complete in her Discrete mathematics study.
Her work deals with themes such as Maximum flow problem and Binary logarithm, which intersect with Algorithm.
She most often published in these fields:
- Mathematical optimization (31.88%)
- Combinatorics (29.47%)
- Time complexity (24.64%)
What were the highlights of her more recent work (between 2016-2021)?
- Artificial intelligence (10.14%)
- Mathematical optimization (31.88%)
- Cluster analysis (5.31%)
In recent papers she was focusing on the following fields of study:
Dorit S. Hochbaum mainly investigates Artificial intelligence, Mathematical optimization, Cluster analysis, Algorithm and Computational biology.
Her Artificial intelligence study combines topics in areas such as Machine learning, Combinatorial optimization and Pattern recognition.
Her work on Integer programming as part of general Mathematical optimization study is frequently linked to Competitive algorithm, Storage Problem and Independent and identically distributed random variables, therefore connecting diverse disciplines of science.
When carried out as part of a general Algorithm research project, her work on Time complexity, Minimum cut and Approximation algorithm is frequently linked to work in Sparse matrix, therefore connecting diverse disciplines of study.
Her Time complexity study results in a more complete grasp of Combinatorics.
Her studies in Approximation algorithm integrate themes in fields like Vertex connectivity and Computation.
Between 2016 and 2021, her most popular works were:
- HNCcorr: A Novel Combinatorial Approach for Cell Identification in Calcium-Imaging Movies (18 citations)
- A comparative study of the leading machine learning techniques and two new optimization algorithms (16 citations)
- HNCcorr: A Novel Combinatorial Approach for Cell Identification in Calcium-Imaging Movies. (11 citations)
In her most recent research, the most cited papers focused on:
- Algorithm
- Artificial intelligence
- Machine learning
Dorit S. Hochbaum spends much of her time researching Computational biology, Cluster analysis, Combinatorial optimization, Artificial intelligence and Approximation algorithm.
The concepts of her Computational biology study are interwoven with issues in Phenotype and Genetic heterogeneity.
Her Cluster analysis research focuses on Image segmentation and how it connects with Theoretical computer science, Range, Partition and Optimization problem.
Her study on Combinatorial optimization also encompasses disciplines like
- Pattern recognition that connect with fields like Benchmark,
- Pixel which connect with Similarity.
Her Artificial intelligence research incorporates elements of Machine learning and Graph.
Approximation algorithm is the subject of her research, which falls under Mathematical optimization.
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.
