World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
57
Citations
17018
World Ranking
3767
National Ranking
1798

Mathematics

D-Index
57
Citations
16875
World Ranking
677
National Ranking
342

Research.com Recognitions

  • 2014 - SIAM Fellow For contributions to the design and analysis of approximation algorithms, flow problems, and their innovative use in applications, and in solving NP-hard problems.
  • 2005 - Fellow of the Institute for Operations Research and the Management Sciences (INFORMS)

Overview

Dorit S. Hochbaum is affiliated with the University of California, Berkeley in the United States. Their research spans several areas within computer science and engineering, focusing primarily on algorithm design, optimization problems, and applications in various domains including bioinformatics and manufacturing.

Their work covers multiple fields of study and subfields, including:

  • Computer Science
  • Engineering
  • Artificial Intelligence
  • Industrial and Manufacturing Engineering
  • Computational Theory and Mathematics
  • Statistics and Probability
  • Management Science and Operations Research

Main topics addressed in their research include:

  • Multi-Criteria Decision Making
  • Optimization and Packing Problems
  • Advanced Causal Inference Techniques
  • Statistical Methods and Inference
  • Bioinformatics and Genomic Networks
  • Gene expression and cancer classification
  • Advanced Manufacturing and Logistics Optimization

Some of the recent scientific papers by Dorit S. Hochbaum demonstrate their engagement with both theoretical and applied problems in operational research and related fields:

  • "Network-based approaches elucidate differences within APOBEC and clock-like signatures in breast cancer," 2020, Genome Medicine
  • "Identifying Drug Sensitivity Subnetworks with NETPHIX," 2020, iScience
  • "A unified approach for a 1D generalized total variation problem," 2021, Mathematical Programming
  • "Network flow methods for the minimum covariate imbalance problem," 2021, European Journal of Operational Research
  • "A fast and effective breakpoints heuristic algorithm for the quadratic knapsack problem," 2024, European Journal of Operational Research

Frequent co-authors working alongside Hochbaum include:

  • Xu Rao
  • Olivier Goldschmidt
  • Yoo-Ah Kim
  • Damian Wójtowicz
  • Rebecca Sarto Basso

Their scholarly output is often published in venues such as:

  • arXiv (Cornell University)
  • European Journal of Operational Research
  • Networks
  • INFORMS Journal on Computing
  • Operations Research Letters

Dorit S. Hochbaum has received recognition including the SIAM Fellow award in 2014 for contributions to approximation algorithms, flow problems, and their application in solving NP-hard problems. They were also named a Fellow of the Institute for Operations Research and the Management Sciences (INFORMS) in 2005.

Best Publications

  • A Best Possible Heuristic for the k-Center Problem

    Dorit S. Hochbaum;David B. Shmoys

  • Using dual approximation algorithms for scheduling problems theoretical and practical results

    Dorit S. Hochbaum;David B. Shmoys

  • Approximation schemes for covering and packing problems in image processing and VLSI

    Dorit S. Hochbaum;Wolfgang Maass

  • Approximation Algorithms for the Set Covering and Vertex Cover Problems

    Dorit S. Hochbaum

  • A unified approach to approximation algorithms for bottleneck problems

    Dorit S. Hochbaum;David B. Shmoys

  • A polynomial approximation scheme for scheduling on uniform processors: Using the dual approximation approach

    Dorit s. Hochbaum;David B. Shmoys

  • Heuristics for the fixed cost median problem

    Dorit S. Hochbaum

  • Efficient bounds for the stable set, vertex cover and set packing problems

    Dorit S. Hochbaum

  • Approximating covering and packing problems: set cover, vertex cover, independent set, and related problems

    Dorit S. Hochbaum

  • An efficient algorithm for Co-segmentation

    Dorit S. Hochbaum;Vikas Singh

  • A Polynomial Algorithm for the k-cut Problem for Fixed k

    Olivier Goldschmidt;Dorit S. Hochbaum

  • The Pseudoflow Algorithm: A New Algorithm for the Maximum-Flow Problem

    Dorit S. Hochbaum

  • Convex separable optimization is not much harder than linear optimization

    D. S. Hochbaum;J. George Shanthikumar

  • Analysis of the greedy approach in problems of maximum k‐coverage

    Dorit S. Hochbaum;Anu Pathria

  • Methodologies and Algorithms for Group-Rankings Decision

    Dorit S. Hochbaum;Asaf Levin

  • An efficient algorithm for image segmentation, Markov random fields and related problems

    Dorit S. Hochbaum

  • Performance Analysis and Best Implementations of Old and New Algorithms for the Open-Pit Mining Problem

    Dorit S. Hochbaum;Anna Chen

  • Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality

    Dorit S. Hochbaum

  • Database Location in Computer Networks

    Marshall L. Fisher;Dorit S. Hochbaum

  • Polynomial algorithm for the k-cut problem

    O. Goldschmidt;D.S. Hochbaum

Frequent Co-Authors

David B. Shmoys
David B. Shmoys Cornell University
Ron Shamir
Ron Shamir Tel Aviv University
Ravindra K. Ahuja
Ravindra K. Ahuja University of Florida
J. George Shanthikumar
J. George Shanthikumar Purdue University West Lafayette
Roded Sharan
Roded Sharan Tel Aviv University
Nimrod Megiddo
Nimrod Megiddo IBM (United States)
Wolfgang Maass
Wolfgang Maass Graz University of Technology
Joseph (Seffi) Naor
Joseph (Seffi) Naor Technion – Israel Institute of Technology
Bhaskar Krishnamachari
Bhaskar Krishnamachari University of Southern California

If you think any of the details on this page are incorrect, let us know.

Report an issue

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:

Related Online Degrees & Career Pathways

Studying Mathematics in the USA opens doors to various career pathways, often complemented by advanced degrees in related fields. For those interested in business leadership roles, exploring the easiest mba online programs can provide a flexible and manageable way to earn a valuable business degree alongside mathematical expertise.

If affordability is a priority, candidates might consider online dba programs that focus on advanced business administration with a practical approach. These programs often attract math graduates aiming to sharpen analytical and strategic skills for top executive positions.

For individuals looking to blend finance with mathematics, the option of online masters in finance offers an affordable path to specialize in financial models, risk management, and quantitative analysis — key areas where math graduates excel.

Time-conscious students can explore the fastest online mba programs which allow earning an MBA degree quickly without compromising quality. Combining math skills with business acumen through such programs is a strategic move for accelerated career growth.

Best Scientists Citing Dorit S. Hochbaum

Trending Scientists

Recently Published Articles