Authors: Karloff, H

Citation: H. Karloff, Ninth Annual ACM-SIAM Symposium on Discrete Algorithms - Foreword, J ALGORITHM, 37(1), 2000, pp. 1-1

Authors: Blum, A Karloff, H Rabani, Y Saks, M

Citation: A. Blum et al., A decomposition theorem for task systems and bounds for randomized server problems, SIAM J COMP, 30(5), 2000, pp. 1624-1661

Authors: Calinescu, G Karloff, H

Citation: G. Calinescu et H. Karloff, An improved approximation algorithm for multiway cut, J COMPUT SY, 60(3), 2000, pp. 564-574

Authors: Freund, A Karloff, H

Citation: A. Freund et H. Karloff, A lower bound of 8/(7+1/k-1) on the integrality ratio of the Calinescu-Karloff-Rabani relaxation for multiway cut, INF PROCESS, 75(1-2), 2000, pp. 43-50

Authors: Karloff, H

Citation: H. Karloff, How good is the Goemans{Williamson MAX CUT algorithm?, SIAM J COMP, 29(1), 1999, pp. 336-350

Authors: Chandra, B Karloff, H Tovey, C

Citation: B. Chandra et al., New results on the old k-opt algorithm for the traveling salesman problem, SIAM J COMP, 28(6), 1999, pp. 1998-2029