B. J. Lageweg

Learn More
Acknowledgements The work presented here has been carried out at the CWI in Amsterdam as part of the ScheduLink subproject within the Par Tool project. The ParTool project is partially supported by SPIN, a Dutch computer science stimulation program. I am truly grateful to my supervisor, Jan Karel Lenstra, and my other co-authors, Han Hoogeveen, Ben Lageweg,(More)
In the test cover problem a set of items is given together with a collection of subsets of the items, called tests. A smallest subcollection of tests is to be selected such that for every pair of items there is a test in the selection that contains exactly one of the two items. This problem is NP-hard in general. It has important applications in biology,(More)
We describe a computer program that has been used to maintain a record of the known complexity results for a class of 4536 machine scheduling problems. The input of the program consists of a listing of known “easy” problems and a listing of known “hard” problems. The program employs the structure of the problem class to determine the(More)
  • 1