M. R. Garey
D. S. Johnson
ABSTRACT
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 DIRECTED HAMILTONIAN PATH problems are restricted to planar graphs, the two problems remain NP-complete, and that these and other graph problems remain NP-complete even when their domains are restricted to graphs with low node degrees. For GRAPH 3-COLORABILITY, NODE COVER, and UNDIRECTED HAMILTONIAN CIRCUIT, we determine essentially the lowest possible upper bounds on node degree for which the problems remain NP-complete.
- 1.D. Adolphson and T. C. Hu, "Optimal Linear Ordering," SIAM J. Applied Math. 25 (1973), 403-423.Google Scholar
Digital Library
- 2.R. L. Brooks, "On Coloring the Nodes of a Network," Proc. Cambridge Philos. Soc., 37 (1941), 194-197.Google ScholarCross Ref
- 3.S. A. Cook, "The Complexity of Theorem-Proving Procedures," STOC (1971), 151-158. Google ScholarDigital Library
- 4.J. Edmonds and E. L. Johnson, "Matching: A Well-Solved Class of Integer Linear Programs," Combinatorial Structures and Their Applications, Gordon and Breach (1970), 89-92.Google Scholar
- 5.S. Even, A. Lempel, and A. Pnueli, "Permutation Graphs and Transitive Graphs," JACM 19 (1972), 400-410. Google ScholarDigital Library
- 6.M. R. Garey, R. L. Graham, J. D. Ullman, "Worst-Case Analysis of Memory Allocation Algorithms," STOC (1972), 143-150. Google ScholarDigital Library
- 7.F. Gavril, "Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent set of a Chordal Graph," SIAM J. Computing 1 (1972), 180-187.Google ScholarDigital Library
- 8.F. Gavril, "Algorithms for a Maximum Clique and a Maximum Independent Set of a Circle Graph," Networks 3 (1973), 261-273.Google ScholarCross Ref
- 9.R. L. Graham, "Bounds on Multiprocessing Anomalies and Related Packing Algorithms," SJCC (1972), 205-217.Google Scholar
- 10.P. Herrmann, Reducibility among Combinatorial Problems, Masters Thesis, Massachusetts Institute of Technology (1973).Google Scholar
- 11.D. S. Johnson, "Fast Allocation Algorithms," SWAT (1972), 144-154.Google Scholar
- 12.D. S. Johnson, "Approximation Algorithms for Combinatorial Problems," STOC (1973), 38-49. Google ScholarDigital Library
- 13.R. M. Karp, "Reducibility Among Combinatorial Problems," Complexity of Computer Computations, R. E. Miller and J. W. Thatcher, eds., Plenum Press, New York (1972), 85-104.Google Scholar
- 14.B. W. Kernighan and S. Lin, "An Efficient Heuristic For Partitioning Graphs," BSTJ 49 (1970), 291-308.Google ScholarCross Ref
- 15.S. Lin and B. W. Kernighan, "An Effective Heuristic Algorithm for the Traveling-Salesman Problem," BSTJ 21 (1973), 498-516.Google Scholar
- 16.G. I. Orlova and Y. G. Dorfman, "Finding the Maximum Cut in a Graph," Eng. Cybernetics 10 (1972), 502-506.Google Scholar
- 17.S. Sahni, "Some Related Problems From Network Flows, Game Theory, and Integer Programming," SWAT (1972), 130-138.Google Scholar
- 18.S. Sahni, On the Knapsack and Other Computationally Related Problems, Doctoral thesis, Cornell University (1973). Google ScholarDigital Library
- 19.R. Sethi, "Complete Register Allocation Problems," STOC (1973), 182-195. Google ScholarDigital Library
- 20.L. Stockmeyer, "Planar 3-Colorability is Polynomial Complete," SIGACT News 5, No. 3 (1973), 19-25. Google ScholarDigital Library
- 21.J. D. Ullman, "Polynomial Complete Scheduling Problems," 4th Symp. on Operating System Principles (1973), 96-101. Google ScholarDigital Library
Index Terms
Some simplified NP-complete problems
Recommendations
Splitting NP-Complete Sets
We show that a set is m-autoreducible if and only if it is m-mitotic. This solves a long-standing open question in a surprising way. As a consequence of this unconditional result and recent work by Glaßer et al., complete sets for all of the following ...
AND-Compression of NP-Complete Problems: Streamlined Proof and Minor Observations
Drucker (Proceedings of the 53rd annual symposium on foundations of computer science (FOCS), pp 609---618. doi:10.1109/FOCS.2012.71, 2012) proved the following result: Unless the unlikely complexity-theoretic collapse $$\mathsf {coNP}\subseteq \mathsf {...
Problem kernels for NP-complete edge deletion problems: split and related graphs
ISAAC'07: Proceedings of the 18th international conference on Algorithms and computationIn an edge deletion problem one is asked to delete at most k edges from a given graph such that the resulting graph satisfies a certain property. In this work, we study four NP-complete edge deletion problems where the goal graph has to be a chain, a ...
Comments