- Marshall L. Fisher and Dorit S. Hochbaum. Database location in computer
networks. Journal of the ACM, 27(4):718-735, October
1980.
Citations.
- Dorit S. Hochbaum and Wolfgang Maass. Approximation schemes for
covering and packing problems in image processing and VLSI.
Journal of the ACM, 32(1):130-136, January 1985.
Citations.
- Dorit S. Hochbaum and David B. Shmoys. A unified approach to approximate
algorithms for bottleneck problems. Journal of the ACM,
33(3):533-550, July 1986.
Citations.
- Dorit S. Hochbaum and David B. Shmoys. Using dual approximation
algorithms for scheduling problems: Theoretical and practical
results. Journal of the ACM, 34(1):144-162, January
1987.
Citations.
- Dorit S. Hochbaum and J. George Shanthikumar. Convex separable optimization is
not much harder than linear optimization. Journal of the
ACM, 37(4):843-862, October 1990.
References,
Citations,
etc.
Shortcuts: