Jan Karel Lenstra


Full Name Prof.dr. J.K. Lenstra
Function(s) CWI-Fellow
Telephone +31 20 592 4089
Room M339
Department(s) CWI Management


Combinatorial optimization, in particular computational complexity, design and analysis of approximation algorithms and local search methods.

Selected Publications

  • K.M.J. de Bontridder, B.V. Halldórsson, M.M. Halldórsson, C.A.J. Hurkens, J.K. Lenstra, R. Ravi, L. Stougie, Approximation algorithms for the test cover problem, 477-492, 2003
  • D.P. Williamson, L.A. Hall, J.A. Hoogeveen, C.A.J. Hurkens, J.K. Lenstra, S.V. Sevast'janov, D.B. Shmoys, Short shop schedules, I.N.F.O.R.M.S., 288-294, 1997
  • J.K. Lenstra, D.B. Shmoys, É. Tardos, Approximation algorithms for scheduling unrelated parallel machines, Springer, 259-271, 1990
  • M.A.H. Dempster, M.L. Fisher, L. Jansen, B.J. Lageweg, J.K. Lenstra, A.H.G. Rinnooy Kan, Analysis of heuristics for stochastic programming: results for hierarchical scheduling problems, INFORMS, 525-537, 1983
  • E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, Generating all maximal independent sets; NP-hardness and polynomial-time algorithms, SIAM, 558-565, 1980
  • R.L. Graham, E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, Optimization and approximation in deterministic sequencing and scheduling: A survey, 287-326, 1979
  • J.K. Lenstra, A.H.G. Rinnooy Kan, P. Brucker, Complexity of machine scheduling problems, 343-362, 1977