Etcheverry Hall
University of California
Berkeley, CA 94720
TEL: (510) 642-4998
dhochbaum at berkeley.edu
I try to be an optimizer in whatever I do, and my research interests reflect that. Some problem applications I am interested in include:
The Book on Approximation Algorithms is now available in PDF format. You can download it here.
Khachian Prize, yeyyy.
A new, very efficient, breakpoints algorithm for the quadratic Knapsack problem, based on the parametric HPF procedure. A Fast and Effective Breakpoints Algorithm for the Quadratic Knapsack Problem. arXiv:2408.12183 [math.OC] Aug 2024.
UC Berkeley, along with Georgia Tech, USC and other universities, was awarded $20M for the NSF National AI Institute for Advances in Optimization, 2021-2026. I serve as co-PI on this award.
As for older news:
A new maximum diversity algorithm IEOR News.
The neuron segmentation algorithm HNCcorr is one of the leading algorithms in the Neurofinder benchmark for cell identification in calcium imaging movies. The algorithm is HNC (Hochbaum Normalized Cut), aka NC', with similarities based on distances in correlation space. This is joint work with Quico Spaen and Roberto Asin.
Software for algorithms used and developed in my research group.