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}
}
  • M. Garey, D. Johnson, L. Stockmeyer
  • Published in STOC '74 1974
  • Mathematics, Computer Science
  • 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
    Planar Formulae and Their Uses
    • 725
    On isomorphisms and density of NP and other complete sets
    • 174
    • PDF
    Consistency in Networks of Relations
    • 2,737
    • PDF
    Optimal linear labelings and eigenvalues of graphs
    • 143
    Frequency assignment: Theory and applications
    • 1,256
    On the Complexity of Some Two-Person Perfect-Information Games
    • 224
    Completeness classes in algebra
    • 502
    Non Deterministic Polynomial Optimization Problems and their Approximations
    • 158
    Complexity Results on Graphs with Few Cliques
    • 42
    • PDF