Computer-Aided Complexity Classification of Combinatorial Problems

@article{Lageweg1982ComputerAidedCC,
  title={Computer-Aided Complexity Classification of Combinatorial Problems},
  author={B. J. Lageweg and Jan Karel Lenstra and Alexander H. G. Rinnooy Kan},
  journal={Commun. ACM},
  year={1982},
  volume={25},
  pages={817-822}
}
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 implications of these results. The output provides a listing of essential results in the form of maximal easy and minimal hard problems as well as listings of… CONTINUE READING

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
21 Extracted Citations
2 Extracted References
Similar Papers

Citing Papers

Publications influenced by this paper.

Referenced Papers

Publications referenced by this paper.
Showing 1-2 of 2 references

Sequencing jobs to minimize total weighted completion time subject to precedence constraints

  • E. L. Lawler
  • Ann. Discrete Math
  • 1978
Highly Influential
4 Excerpts

Introduction to Sequencing and Scheduling

  • K. R. Baker
  • 1974
Highly Influential
4 Excerpts

Similar Papers

Loading similar papers…