# Some simplified NP-complete problems

@inproceedings{Garey1974SomeSN, title={Some simplified NP-complete problems}, author={M. Garey and D. Johnson and L. Stockmeyer}, booktitle={STOC '74}, year={1974} }

It is widely believed that showing a problem to be NP-complete is tantamount to proving its computational intractability. In this paper we show that a number of NP-complete problems remain NP-complete even when their domains are substantially restricted. First we show the completeness of SIMPLE MAX CUT (MAX CUT with edge weights restricted to value 1), and, as a corollary, the completeness of the OPTIMAL LINEAR ARRANGEMENT problem. We then show that even if the domains of the NODE COVER and… CONTINUE READING

506 Citations

Non Deterministic Polynomial Optimization Problems and their Approximations

- Mathematics, Computer Science
- 1981

- 158