Anzeige
Erschienen in:
1994 | OriginalPaper | Buchkapitel
NP-Hard Problems
verfasst von : V. S. Tanaev, V. S. Gordon, Y. M. Shafransky
Erschienen in: Scheduling Theory. Single-Stage Systems
Verlag: Springer Netherlands
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
This chapter establishes the NP-hardiness of a number of scheduling problems. To prove that a given Problem B is NP-hard, we use the following scheme. The decision Problem B’ corresponding to Problem B is formulated, and a Problem A is shown to be polynomially reducible to B’ where A is one of the standard problems, i.e., a decision problem known to be NP-complete. If Problem A is NP-complete in the strong sense, then sometimes it is shown to be pseudopolynomially reducible to Problem B’.