Dorit S. Hochbaum

Papers

Total Citations

H-Index

About

Dorit S. Hochbaum is a leading figure in combinatorial optimization and approximation algorithms, with a particular focus on nonconvex covering problems and their applications in robotics and VLSI design. Her seminal 1987 paper, "Fast approximation algorithms for a nonconvex covering problem," which has garnered 44 citations, introduced groundbreaking techniques for efficiently solving complex geometric covering challenges that were previously intractable. This work, building on her earlier 1984 study of approximation schemes for covering and packing in robotics and VLSI (9 citations), established her as a pioneer in bridging theoretical computer science with practical engineering needs. Hochbaum's contributions have profoundly impacted the design of efficient algorithms for resource allocation, facility location, and manufacturing systems. Her research is characterized by elegant mathematical formulations that yield provably near-optimal solutions with polynomial-time guarantees, making her work essential reading for students and researchers in operations research, computer science, and industrial engineering.